Year: 2011
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Kloks, Ton
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1555699111