A Characterization of Almost-Planar Graphs

DOI10.1017/S0963548300002005zbMath0860.05026WikidataQ29011720 ScholiaQ29011720MaRDI QIDQ4715268

Bradley S. Gubser

Publication date: 16 December 1996

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

zbMATH Keywords

characterizationminorplanar graphalmost-planar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)

Related Items (8)

Graph operations and neighborhood polynomials ⋮ Delta-wye transformations and the efficient reduction of almost-planar graphs ⋮ Six variations on a theme: almost planar graphs ⋮ An algorithm for delta-wye reduction of almost-planar graphs ⋮ All minor-minimal apex obstructions with connectivity two ⋮ Delta-wye reduction of almost-planar graphs ⋮ On almost-planar graphs ⋮ Almost-graphic matroids

Cites Work

• Decomposition of regular matroids
• A characterization of 3-connected graphs containing a given graph
• Über eine Eigenschaft der ebenen Komplexe
• A note on primitive skew curves
• Unnamed Item

This page was built for publication: A Characterization of Almost-Planar Graphs