Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs

Authors:
Michael R. Fellows;Danny Hermelin;Frances A. Rosamond
Affiliations:
School of Electrical Engineering and Computer Science, The University of Newcastle, Calaghan, Australia NSW 2308;Department of Computer Science, University of Haifa, Mount Carmel, Haifa, Israel 31905;School of Electrical Engineering and Computer Science, The University of Newcastle, Calaghan, Australia NSW 2308
Venue:
Parameterized and Exact Computation
Year:
2009

Citing 0
Cited 4

Hypertree-depth and minors in hypergraphs

Theoretical Computer Science
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity

European Journal of Combinatorics
Polynomial time and parameterized approximation algorithms for boxicity

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Well-structured graph transformation systems with negative application conditions

ICGT'12 Proceedings of the 6th international conference on Graph Transformations

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that three subclasses of bounded treewidth graphs are well-quasi-ordered by refinements of the minor order. Specifically, we prove that graphs with bounded feedback-vertex-set are well-quasi-ordered by the topological-minor order, graphs with bounded vertex-covers are well-quasi-ordered by the subgraph order, and graphs with bounded circumference are well-quasi-ordered by the induced-minor order. Our results give an algorithm for recognizing any graph family in these classes which is closed under the corresponding minor order refinement.