The obstructions of a minor-closed set of graphs defined by a context-free grammar

DOI10.1016/S0012-365X(97)83079-8zbMath0889.68116OpenAlexW2050331555MaRDI QIDQ1379821

Géraud Sénizergues

Publication date: 25 February 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)83079-8

zbMATH Keywords

hyperedge replacement grammar

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42)

Cites Work

• Hyperedge replacement: grammars and languages
• Graph minors. XX: Wagner's conjecture
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
• Quickly excluding a planar graph
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Graph expressions and graph rewritings
• The Recognition of Series Parallel Digraphs
• The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The obstructions of a minor-closed set of graphs defined by a context-free grammar