Graphs without even holes or diamonds

Ton Kloks

Graphs without even holes or diamonds

Combinatorics 2011-04-21 v1

Authors: Ton Kloks

Abstract

An even hole is an induced chordless cycle of even length at least four. A diamond is an induced subgraph isomorphic to K_4-e. We show that graphs without even holes and without diamonds can be decomposed via clique-separators into graphs that have uniformly bounded cliquewidth.

Keywords

graph theory graph cycles random graphs

Cite

@article{arxiv.1104.3920,
  title  = {Graphs without even holes or diamonds},
  author = {Ton Kloks},
  journal= {arXiv preprint arXiv:1104.3920},
  year   = {2011}
}

Related papers

View all related →

Discrete Mathematics · Computer Science

Clique Separator Decomposition of Hole- and Diamond-Free Graphs and Algorithmic Consequences