Graphs without \(K_ 4\) and well-quasi-ordering

DOI10.1016/0095-8956(85)90069-3zbMath0565.05058OpenAlexW1997237635MaRDI QIDQ1058531

Robin Thomas

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(85)90069-3

zbMATH Keywords

induced subgraphwell-quasi-orderinggraph minorsseries parallel graphs

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (4)

The complexity of induced minors and related problems ⋮ Induced minors and well-quasi-ordering ⋮ Recent Progress on Well-Quasi-ordering Graphs ⋮ Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications

Cites Work

• Unnamed Item
• 103 graphs that are irreducible for the projective plane
• Wohlquasigeordnete Klassen endlicher Graphen
• Graph minors. IV: Tree-width and well-quasi-ordering
• A kuratowski theorem for the projective plane
• Topology of Thin Film RC Circuits
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: Graphs without \(K_ 4\) and well-quasi-ordering