Tree-width dichotomy
Authors:
- Vadim LozinVLVadim Lozin
- Igor RazgonIRIgor Razgon
Open Access
- 21 February 2022
- journal article
- research article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 103
Abstract
No abstract availableAll Related Versions
This publication has 12 references indexed in Scilit:
- Extending the Gyárfás–Sumner conjectureJournal of Combinatorial Theory, Series B, 2014
- Boundary Classes of Planar GraphsCombinatorics, Probability and Computing, 2008
- Graph Minors. XX. Wagner's conjectureJournal of Combinatorial Theory, Series B, 2004
- Induced Subdivisions In K s,s -Free Graphs of Large Average DegreeCombinatorica, 2004
- On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex DegreeSIAM Journal on Discrete Mathematics, 2004
- On easy and hard hereditary classes of graphs with respect to the independent set problemDiscrete Applied Mathematics, 2003
- A partial k-arboretum of graphs with bounded treewidthTheoretical Computer Science, 1998
- Treewidth for graphs with small chordalityDiscrete Applied Mathematics, 1997
- Graph minors. V. Excluding a planar graphJournal of Combinatorial Theory, Series B, 1986
- Graph Theory and ProbabilityCanadian Journal of Mathematics, 1959