A new planarity criterion for 3-connected graphs

DOI10.1002/JGT.3190050307MaRDI QIDQ3205249zbMATH OpenOpenAlexFDO

Authors Alexander 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

cyclegraph decompositionplanar3-connected graphgraph planaritynon-separating

Mathematics Subject Classification ID

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

Cited in

(7)

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

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

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