K.K. Dabrowski
Tree pivot-minors and linear rank-width
Dabrowski, K.K.; Dross, F.; Jeong, J.; Kante, M.M.; Kwon, O.; Oum, S.; Paulusma, D.
Authors
F. Dross
J. Jeong
M.M. Kante
O. Kwon
S. Oum
Professor Daniel Paulusma daniel.paulusma@durham.ac.uk
Professor
Abstract
Tree-width and its linear variant path-width play a central role for the graph minor relation. In particular, Robertson and Seymour (1983) proved that for every tree T, the class of graphs that do not contain T as a minor has bounded path-width. For the pivot-minor relation, rank-width and linear rank-width take over the role of tree-width and path-width. As such, it is natural to examine if, for every tree T, the class of graphs that do not contain T as a pivot-minor has bounded linear rank-width. We first prove that this statement is false whenever T is a tree that is not a caterpillar. We conjecture that the statement is true if T is a caterpillar. We are also able to give partial confirmation of this conjecture by proving: • for every tree T, the class of T-pivot-minor-free distance-hereditary graphs has bounded linear rank-width if and only if T is a caterpillar; • for every caterpillar T on at most four vertices, the class of T-pivot-minor-free graphs has bounded linear rank-width. To prove our second result, we only need to consider T “ P4 and T “ K1,3, but we follow a general strategy: first we show that the class of T-pivot-minor-free graphs is contained in some class of pH1, H2q-free graphs, which we then show to have bounded linear rank-width. In particular, we prove that the class of pK3, S1,2,2q-free graphs has bounded linear rank-width, which strengthens a known result that this graph class has bounded rank-width.
Citation
Dabrowski, K., Dross, F., Jeong, J., Kante, M., Kwon, O., Oum, S., & Paulusma, D. (2021). Tree pivot-minors and linear rank-width. SIAM Journal on Discrete Mathematics, 35(4), 2922-2945. https://doi.org/10.1137/21m1402339
Journal Article Type | Article |
---|---|
Acceptance Date | Aug 11, 2021 |
Online Publication Date | Dec 7, 2021 |
Publication Date | 2021 |
Deposit Date | Aug 23, 2021 |
Publicly Available Date | Aug 24, 2021 |
Journal | SIAM Journal on Discrete Mathematics |
Print ISSN | 0895-4801 |
Electronic ISSN | 1095-7146 |
Publisher | Society for Industrial and Applied Mathematics |
Peer Reviewed | Peer Reviewed |
Volume | 35 |
Issue | 4 |
Pages | 2922-2945 |
DOI | https://doi.org/10.1137/21m1402339 |
Public URL | https://durham-repository.worktribe.com/output/1266267 |
Files
Accepted Journal Article
(404 Kb)
PDF
You might also like
Computing balanced solutions for large international kidney exchange schemes
(2024)
Journal Article
An Algorithmic Framework for Locally Constrained Homomorphisms
(2024)
Journal Article
Solving problems on generalized convex graphs via mim-width
(2023)
Journal Article
The Complexity of Matching Games: A Survey
(2023)
Journal Article
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs
(2023)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search