Wheel-free planar graphs
From MaRDI portal
Publication:2349958
DOI10.1016/j.ejc.2015.02.027zbMath1315.05035arXiv1309.7120OpenAlexW2043831429MaRDI QIDQ2349958
Pierre Aboulker, Nicolas Trotignon, Maria Chudnovsky, P. D. Seymour
Publication date: 18 June 2015
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.7120
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items (3)
The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs ⋮ Wheels in planar graphs and Hajós graphs ⋮ Stable sets in \(\{\mathrm{ISK4,wheel}\}\)-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Edge-colouring and total-colouring chordless graphs
- On graphs with no induced subdivision of \(K_4\)
- Non-separating induced cycles in graphs
- Vertex elimination orderings for hereditary graph classes
- Detecting wheels
- Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It
- A structure theorem for graphs with no cycle with a unique chord and its consequences
This page was built for publication: Wheel-free planar graphs
