A new planarity criterion for 3-connected graphs

DOI10.1002/jgt.3190050307zbMath0416.05033OpenAlexW2025723590MaRDI QIDQ3205249

Alexander K. Kelmans

Publication date: 1981

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190050307

zbMATH Keywords

cycleplanar3-connected graphgraph decompositiongraph planaritynon-separating

Mathematics Subject Classification ID

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

Related Items (7)

On convex embeddings of planar 3-connected graphs ⋮ On prisms, Möbius ladders and the cycle space of dense graphs ⋮ \(k\)-circular matroids of graphs ⋮ Connected hyperplanes in binary matroids ⋮ Removing circuits in 3-connected binary matroids ⋮ Non-separating cocircuits in binary matroids ⋮ The theorem on planar graphs

This page was built for publication: A new planarity criterion for 3-connected graphs