Subdivisions in planar graphs

DOI10.1006/jctb.1997.1774zbMath0888.05022OpenAlexW2044422372MaRDI QIDQ1366603

Xingxing Yu

Publication date: 15 September 1997

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1997.1774

zbMATH Keywords

connectivityplanar graphsubdivisionsdisjoint pathsplane embedding

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Related Items (7)

Linkage for the diamond and the path with four vertices ⋮ Subdivisions in apex graphs ⋮ Independent paths and \(K_{5}\)-subdivisions ⋮ Linking four vertices in graphs of large connectivity ⋮ Graphs Containing TopologicalH ⋮ Rooted topological minors on four vertices ⋮ Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\)

Cites Work

• Unnamed Item
• Graph minors. VI. Disjoint paths across a disc
• Homomorphism theorems for graphs
• Some Homeomorphism Properties of Graphs
• Do 3n − 5 edges force a subdivision ofK5?

This page was built for publication: Subdivisions in planar graphs