Subdivisions of K₅ in graphs containing K₂,3

DOI10.1016/J.JCTB.2014.12.008MaRDI QIDQ2347843zbMATH OpenOpenAlexFDO

Authors Ken-ichi Kawarabayashi, Jie Ma, Xingxing Yu

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

chain of blocksindependent pathsKelmans-Seymour conjectureMader's conjectureplanar chainseparationsubdivision

Mathematics Subject Classification ID

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

Recommendations

• K₅-Subdivisions in Graphs
• scientific article; zbMATH DE number 2188433
• K₅^--subdivision in 4-connected graphs
• Subdivisions of \(K_{5}\) in graphs embedded on surfaces with face-width at least 5
• Graphs with \(3n-6\) edges not containing a subdivision of \(K_5\)
• Embedding graphs containing K₅-subdivisions on the torus
• Independent paths and \(K_{5}\)-subdivisions
• k-subdomination in graphs
• Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\)
• An extremal problem for subdivisions ofK?5

Cites work

• 2-linked graphs
• \(3n-5\) edges do force a subdivision of \(K_5\)
• A Polynomial Solution to the Undirected Two Paths Problem
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• Applications of Menger's graph theorem
• Cycles and Connectivity in Graphs
• Disjoint paths in graphs
• Do 3n − 5 edges force a subdivision ofK5?
• How to Draw a Graph
• Independent paths and \(K_{5}\)-subdivisions
• Nonseparating Cycles in 4-Connected Graphs
• Nonseparating Planar Chains in 4-Connected Graphs
• Subdivisions in apex graphs
• Subdivisions in planar graphs
• Subdivisions of \(K_{5}\) in graphs embedded on surfaces with face-width at least 5

Cited in

(14)

• Rooted topological minors on four vertices
• Subdivisions in apex graphs
• Graphs with \(3n-6\) edges not containing a subdivision of \(K_5\)
• Subdivisions of \(K_{5}\) in graphs embedded on surfaces with face-width at least 5
• Do 3n − 5 edges force a subdivision ofK5?
• K₅^--subdivision in 4-connected graphs
• K₅-Subdivisions in Graphs
• Topological minors in line graphs -- a proof of Zha's conjecture
• Independent paths and \(K_{5}\)-subdivisions
• K₅-subdivisions in graphs containing K₄^-
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2347843)