The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed

DOI10.1007/3-540-61228-9_98zbMath1412.68102OpenAlexW1556349856MaRDI QIDQ4645287

Géraud Sénizergues

Publication date: 10 January 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61228-9_98

zbMATH Keywords

graph grammarminor inclusioninternal vertexminor closurerespective type

Mathematics Subject Classification ID

Graph minors (05C83) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• 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 monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues

This page was built for publication: The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed