(Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels

DOI10.1002/jgt.22666zbMath1522.05040arXiv1906.10998OpenAlexW3153682833MaRDI QIDQ6080861

Nicolas Trotignon, Ni Luh Dewi Sintiari

Publication date: 4 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

treewidtheven-hole-free graphtheta-free graph

Mathematics Subject Classification ID

Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (10)

Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree ⋮ A class of graphs with large rankwidth ⋮ Induced subgraphs and tree decompositions. IV: (Even hole, diamond, pyramid)-free graphs ⋮ Induced subgraphs and tree decompositions. II: Toward walls and their line graphs in graphs of bounded degree ⋮ Induced subgraphs and tree decompositions. VII: Basic obstructions in \(H\)-free graphs ⋮ Induced subgraphs and path decompositions ⋮ Treewidth, Circle Graphs, and Circular Drawings ⋮ Induced subgraphs and tree decompositions V. one neighbor in a hole ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The strong perfect graph theorem
• Claw-free graphs. IV: Decomposition theorem
• Graph minors. V. Excluding a planar graph
• Alpha-balanced graphs and matrices and GF(3)-representability of matroids
• Graph-theoretic concepts in computer science. 26th international workshop, WG 2000, Konstanz, Germany, June 15--17, 2000. Proceedings
• Structure and algorithms for (cap, even hole)-free graphs
• Upper bounds to the clique width of graphs
• The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs
• The \(k\)-in-a-path problem for claw-free graphs
• Approximating clique-width and branch-width
• The world of hereditary graph classes viewed through Truemper configurations
• Excluded Grid Theorem
• On rank-width of even-hole-free graphs
• On the structure of (pan, even hole)‐free graphs
• Even-hole-free graphs: A survey
• A Class of Three‐Colorable Triangle‐Free Graphs
• On the Relationship Between Clique-Width and Treewidth
• Parameterized Algorithms
• Cycles and Connectivity in Graphs

This page was built for publication: (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels