Dabrowski, K. K., Eagling-Vose, T., Köehler, N. et al. (2 more authors) (Accepted: 2025) Bounding Width on Graph Classes of Constant Diameter. In: Lecture Notes in Computer Science. 51st International Workshop on Graph-Theoretic Concepts in Computer Science, 11-13 Jun 2025, Otzenhausen, Germany. Springer (In Press)
Abstract
We determine if the width of a graph class G changes from unbounded to bounded if we consider only those graphs from G whose diameter is bounded. As parameters we consider treedepth, pathwidth, treewidth and clique-width, and as graph classes we consider classes defined by forbidding some specific graph F as a minor, induced subgraph or subgraph, respectively. Our main focus is on treedepth for F-subgraphfree graphs of diameter at most d for some fixed integer d. We give classifications of boundedness of treedepth for d ∈ {4, 5, . . .} and partial classifications for d = 2 and d = 3.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | This is an author produced version of a conference paper accepted for publication in Lecture Notes in Computer Science, made available under the terms of the Creative Commons Attribution License (CC-BY), which permits unrestricted use, distribution and reproduction in any medium, provided the original work is properly cited. |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 13 May 2025 12:45 |
Last Modified: | 20 May 2025 15:37 |
Status: | In Press |
Publisher: | Springer |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:226554 |