Characterizing 3-connected planar graphs and graphic matroids

DOI10.1002/jgt.20446zbMath1231.05059OpenAlexW4254041513MaRDI QIDQ3055913

Manoel Lemos, Haidong Wu, Talmage James Reid

Publication date: 10 November 2010

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

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

zbMATH Keywords

binary matroidsgraphic matroids3-connected planar graphsnon-separating cocircuits

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Related Items (5)

A Characterization of Graphic Matroids Based on Circuit Orderings ⋮ Obstructions to a binary matroid being graphic ⋮ Non-separating cocircuits avoiding some elements ⋮ Nonseparating Cocircuits in Binary Matroids ⋮ A circuit characterization of graphic matroids

Cites Work

• Decomposition of regular matroids
• Stabilizers of classes of representable matroids
• Non-separating cocircuits in binary matroids
• Obstructions to a binary matroid being graphic
• A characterization of graphic matroids using non-separating cocircuits
• On Vertex-Triads in 3-Connected Binary Matroids
• How to Draw a Graph
• Connected hyperplanes in binary matroids

This page was built for publication: Characterizing 3-connected planar graphs and graphic matroids