Well-quasi-ordering \(H\)-contraction-free graphs
From MaRDI portal
Publication:2413963
DOI10.1016/j.dam.2017.02.018zbMath1395.05167arXiv1602.00733OpenAlexW2963637237MaRDI QIDQ2413963
Théophile Trunck, Jean-Florent Raymond, Marcin Kaminski
Publication date: 17 September 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.00733
Related Items (4)
Induced minors and well-quasi-ordering ⋮ 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
Cites Work
- Graph minors. XX: Wagner's conjecture
- Graph minors XXIII. Nash-Williams' immersion conjecture
- On canonical antichains
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
- Subgraphs and well‐quasi‐ordering
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Induced subgraphs and well‐quasi‐ordering
- Ordering by Divisibility in Abstract Algebras
- Unnamed Item
This page was built for publication: Well-quasi-ordering \(H\)-contraction-free graphs
