TY - GEN
T1 - Well-quasi-orders in subclasses of bounded treewidth graphs
AU - Fellows, Michael R.
AU - Hermelin, Danny
AU - Rosamond, Frances A.
PY - 2009/12/24
Y1 - 2009/12/24
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=72249083801&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-11269-0_12
DO - 10.1007/978-3-642-11269-0_12
M3 - Conference contribution
AN - SCOPUS:72249083801
SN - 3642112684
SN - 9783642112683
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 149
EP - 160
BT - Parameterized and Exact Computation - 4th International Workshop, IWPEC 2009, Revised Selected Papers
T2 - 4th International Workshop on Parameterized and Exact Computation, IWPEC 2009
Y2 - 10 September 2009 through 11 September 2009
ER -