Matroids Determine the Embeddability of Graphs in Surfaces

DOI10.2307/2047303zbMath0674.05025OpenAlexW4243492953MaRDI QIDQ3828019

Thomas Zaslavsky

Publication date: 1989

Full work available at URL: https://doi.org/10.2307/2047303

zbMATH Keywords

genuscrosscap numberdemigenuscompact orientable surfacepolygon matroid

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph minors. XX: Wagner's conjecture
• On the Euler genus of a 2-connected graph
• On the non-orientable genus of a 2-connected graph
• Computing the genus of the 2-amalgamations of graphs
• 103 graphs that are irreducible for the projective plane
• How to determine the maximum genus of a graph
• A Kuratowski theorem for nonorientable surfaces
• Graph minors. VIII: A Kuratowski theorem for general surfaces
• Blocks and the nonorientable genus of graphs
• Generalized Embedding Schemes
• Non-Separable and Planar Graphs
• 2-Isomorphic Graphs
• On the surface duality of linear graphs
• The Genus, Regional Number, and Betti Number of a Graph
• Lectures on matroids
• Every planar graph with nine points has a nonplanar complement
• Theory of Matroids