The (theta, wheel)-free graphs. II: Structure theorem

DOI10.1016/j.jctb.2019.07.004zbMath1437.05201arXiv1703.08675OpenAlexW2969297449MaRDI QIDQ2173432

Nicolas Trotignon, Marko Radovanović, Kristina Vušković

Publication date: 22 April 2020

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.08675

zbMATH Keywords

wheeldecomposition theoremthetaTruemper configurations

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (3)

The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs ⋮ The (theta, wheel)-free graphs. III: Cliques, stable sets and coloring ⋮ The (theta, wheel)-free graphs. IV: Induced paths and cycles

Cites Work

• Unnamed Item
• Unnamed Item
• The structure of bull-free graphs II and III -- a summary
• On rigid circuit graphs
• The strong perfect graph theorem
• Universally signable graphs
• Decomposition of even-hole-free graphs with star cutsets and 2-joins
• The (theta, wheel)-free graphs. IV: Induced paths and cycles
• Applications of Menger's graph theorem
• Even-hole-free graphs part I: Decomposition theorem
• The world of hereditary graph classes viewed through Truemper configurations
• A structure theorem for graphs with no cycle with a unique chord and its consequences

This page was built for publication: The (theta, wheel)-free graphs. II: Structure theorem