Graphs without even holes or diamonds
Abstract
An even hole is an induced chordless cycle of even length at least four. A diamond is an induced subgraph isomorphic to K4-e. We show that graphs without even holes and without diamonds can be decomposed via clique-separators into graphs that have uniformly bounded cliquewidth.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.