Comparing width parameters on graph classes
Authors:
- Nick BrettellNBNick Brettell
- Andrea MunaroAMAndrea Munaro
- Daniël PaulusmaDPDaniël Paulusma
- Shizhou YangSYShizhou Yang
Open Access
- 3 May 2025
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 127
Abstract
No abstract availableAll Related Versions
This publication has 46 references indexed in Scilit:
- Tree independence number I. (Even hole, diamond, pyramid)‐free graphsJournal of Graph Theory, 2024
- Bounding the mim‐width of hereditary graph classesJournal of Graph Theory, 2021
- Mim-Width II. The Feedback Vertex Set ProblemAlgorithmica, 2019
- Treewidth of the Line Graph of a Complete GraphJournal of Graph Theory, 2014
- Split Permutation GraphsGraphs and Combinatorics, 2013
- Distance- $d$ independent set problems for bipartite and chordal graphsJournal of Combinatorial Optimization, 2013
- Excluding a bipartite circle graph from line graphsJournal of Graph Theory, 2008
- Rank‐width is less than or equal to branch‐widthJournal of Graph Theory, 2007
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of GraphsJournal of Algorithms, 1996
- Graph minors. I. Excluding a forestJournal of Combinatorial Theory, Series B, 1983