scientific article; zbMATH DE number 475615

MaRDI QIDQ4273871zbMATH OpenFDO

Authors Bruno Courcelle

Publication date 6 January 1994

zbMATH Keywords

forbidden minorsgraph grammarshyperedgemonadic second-order logicvertex replacement

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99) Grammars and rewriting systems (68Q42) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 58310
• Graph structure and monadic second-order logic. A language-theoretic approach
• Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects
• Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
• scientific article; zbMATH DE number 17791
• The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
• scientific article; zbMATH DE number 1696755
• A regular characterization of graph languages definable in monadic second-order logic
• The monadic second-order logic of graphs. VII: Graphs as relational structures
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs

Cited in

(14)

• Treewidth and logical definability of graph products
• On the OBDD size for graphs of bounded tree- and clique-width
• Graph operations characterizing rank-width
• Monadic second-order definable graph transductions: a survey
• The obstructions of a minor-closed set of graphs defined by a context-free grammar
• The monadic second-order logic of graphs. VIII: Orientations
• The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed
• scientific article; zbMATH DE number 7204410 (Why is no real title available?)
• On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
• Quadratic kernelization for convex recoloring of trees
• Basic notions of universal algebra for language theory and graph grammars
• Meta-theorems for graph polynomials
• On homomorphism indistinguishability and hypertree depth
• A finite presentation of graphs of treewidth at most three

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4273871)