Induced minors and well-quasi-ordering

DOI10.1016/j.endm.2015.06.029zbMath1346.05278arXiv1510.07135OpenAlexW2887724485MaRDI QIDQ5890902

Jarosław Błasiok, Marcin Kaminski, Théophile Trunck, Jean-Florent Raymond

Publication date: 14 October 2016

Published in: Electronic Notes in Discrete Mathematics, Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.07135

zbMATH Keywords

well-quasi-orderingcombinatorial dichotomiesinduced minorsstructural graph theory

Mathematics Subject Classification ID

Partial orders, general (06A06) Graph minors (05C83)

Related Items (6)

Forbidden induced subgraphs ⋮ Induced minor free graphs: isomorphism and clique-width ⋮ Recent Progress on Well-Quasi-ordering Graphs ⋮ Clique-width and well-quasi-ordering of triangle-free graph classes ⋮ Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure ⋮ On well quasi-order of graph classes under homomorphic image orderings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Boundary properties of well-quasi-ordered sets of graphs
• Well-quasi-order of relabel functions
• Graph minors. XX: Wagner's conjecture
• Labelled induced subgraphs and well-quasi-ordering
• On canonical antichains
• Graphs without \(K_ 4\) and well-quasi-ordering
• The isomorphism problem for classes of graphs closed under contraction
• Letter graphs and well-quasi-order by induced subgraphs
• Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
• Forbidden substructures and combinatorial dichotomies: WQO and universality
• Two forbidden induced subgraphs and well-quasi-ordering
• Well-quasi-ordering \(H\)-contraction-free graphs
• The theory of well-quasi-ordering: a frequently discovered concept
• Bipartite induced subgraphs and well-quasi-ordering
• Rank-Width and Well-Quasi-Ordering
• Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs
• Subgraphs and well‐quasi‐ordering
• Multigraphs without large bonds are wqo by contraction
• Induced subgraphs and well‐quasi‐ordering
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: Induced minors and well-quasi-ordering