Independent paths and \(K_{5}\)-subdivisions
From MaRDI portal
Publication:602715
DOI10.1016/j.jctb.2010.05.002zbMath1208.05101OpenAlexW1976030201MaRDI QIDQ602715
Publication date: 5 November 2010
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2010.05.002
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (12)
Subdivisions in apex graphs ⋮ Wheels in planar graphs and Hajós graphs ⋮ 4‐Separations in Hajós graphs ⋮ On a coloring conjecture of Hajós ⋮ Graphs Containing TopologicalH ⋮ The Kelmans-Seymour conjecture. I: Special separations ⋮ The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\) ⋮ The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\) ⋮ The Kelmans-Seymour conjecture. IV: A proof ⋮ Subdivisions ofK5in Graphs Embedded on Surfaces With Face-Width at Least 5 ⋮ Rooted topological minors on four vertices ⋮ Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\)
Cites Work
- Disjoint paths in graphs
- 2-linked graphs
- Hajos' graph-coloring conjecture: Variations and counterexamples
- \(3n-5\) edges do force a subdivision of \(K_5\)
- Subdivisions in planar graphs
- Non-separating paths in 4-connected graphs
- Contractible edges and triangles in \(k\)-connected graphs
- Graph connectivity after path removal
- Reducing Hajós' 4-coloring conjecture to 4-connected graphs
- Induced paths in 5-connected graphs
- A Polynomial Solution to the Undirected Two Paths Problem
- Do 3n − 5 edges force a subdivision ofK5?
- Nonseparating Cycles in 4-Connected Graphs
- Cycles and Connectivity in Graphs
- How to Draw a Graph
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Independent paths and \(K_{5}\)-subdivisions
