Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\)

DOI10.1016/j.jctb.2014.12.008zbMath1315.05111OpenAlexW1965400914MaRDI QIDQ2347843

Xingxing Yu, Ken-ichi Kawarabayashi, Jie Ma

Publication date: 10 June 2015

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.2014.12.008

zbMATH Keywords

subdivisionseparationindependent pathsplanar chainMader's conjecturechain of blocksKelmans-Seymour conjecture

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (4)

The Kelmans-Seymour conjecture. I: Special separations ⋮ The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\) ⋮ The Kelmans-Seymour conjecture. IV: A proof ⋮ Rooted topological minors on four vertices

Cites Work

• Independent paths and \(K_{5}\)-subdivisions
• Disjoint paths in graphs
• 2-linked graphs
• \(3n-5\) edges do force a subdivision of \(K_5\)
• Subdivisions in planar graphs
• Subdivisions in apex graphs
• Applications of Menger's graph theorem
• Subdivisions ofK₅in Graphs Embedded on Surfaces With Face-Width at Least 5
• A Polynomial Solution to the Undirected Two Paths Problem
• Do 3n − 5 edges force a subdivision ofK5?
• Nonseparating Cycles in 4-Connected Graphs
• Nonseparating Planar Chains 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

This page was built for publication: Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\)