K5-Subdivisions in Graphs

DOI10.1017/S0963548300001954MaRDI QIDQ4715265zbMATH OpenOpenAlexFDO

Authors Carsten Thomassen

Publication date 12 November 1996

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548300001954

zbMATH Keywords

Dirac's problemsubdivision

Mathematics Subject Classification ID

Graph theory (05C99)

Recommendations

• Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\)
• K₅^--subdivision in 4-connected graphs
• scientific article; zbMATH DE number 2188433
• Subdivisions of \(K_{5}\) in graphs embedded on surfaces with face-width at least 5
• Embedding graphs containing K₅-subdivisions on the torus
• Independent paths and \(K_{5}\)-subdivisions
• S₅-decomposition of Kneser graphs
• 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
• Applications of Menger's graph theorem
• Cycles through specified vertices of a graph
• Disjoint paths in graphs
• Homomorphism theorems for graphs
• Some Homeomorphism Properties of Graphs

Cited in

(10)

• \(3n-5\) edges do force a subdivision of \(K_5\)
• Dirac's conjecture on \(K_ 5\)-subdivisions
• Subdivisions in digraphs of large out-degree or large dichromatic number
• Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\)
• Subdivisions of \(K_{5}\) in graphs embedded on surfaces with face-width at least 5
• Do 3n − 5 edges force a subdivision ofK5?
• An extremal problem for subdivisions ofK?5
• K₅^--subdivision in 4-connected graphs
• The optimal drawings of \(K_{5,n}\)
• The Kelmans-Seymour conjecture. IV: A proof

This page was built for publication: K₅-Subdivisions in Graphs

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