Well-quasi-orders in subclasses of bounded treewidth graphs

Michael R. Fellows, Danny Hermelin, Frances A. Rosamond

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

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.

Original languageEnglish
Title of host publicationParameterized and Exact Computation - 4th International Workshop, IWPEC 2009, Revised Selected Papers
Pages149-160
Number of pages12
DOIs
StatePublished - 24 Dec 2009
Externally publishedYes
Event4th International Workshop on Parameterized and Exact Computation, IWPEC 2009 - Copenhagen, Denmark
Duration: 10 Sep 200911 Sep 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5917 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Workshop on Parameterized and Exact Computation, IWPEC 2009
Country/TerritoryDenmark
CityCopenhagen
Period10/09/0911/09/09

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Well-quasi-orders in subclasses of bounded treewidth graphs'. Together they form a unique fingerprint.

Cite this