Matroids Determine the Embeddability of Graphs in Surfaces
From MaRDI portal
Publication:3828019
Recommendations
- An obstruction to embedding graphs in surfaces
- Matroid Duality from Topological Duality in Surfaces of Nonnegative Euler Characteristic
- Polynomial invariants of graphs on surfaces
- A characterization of the embeddability of graphs on the surface of given genus
- scientific article; zbMATH DE number 1409183
Cites work
- scientific article; zbMATH DE number 3887721 (Why is no real title available?)
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- 103 graphs that are irreducible for the projective plane
- 2-Isomorphic Graphs
- A Kuratowski theorem for nonorientable surfaces
- Blocks and the nonorientable genus of graphs
- Computing the genus of the 2-amalgamations of graphs
- Every planar graph with nine points has a nonplanar complement
- Generalized Embedding Schemes
- Graph minors. VIII: A Kuratowski theorem for general surfaces
- Graph minors. XX: Wagner's conjecture
- How to determine the maximum genus of a graph
- Lectures on matroids
- Non-Separable and Planar Graphs
- On the Euler genus of a 2-connected graph
- On the non-orientable genus of a 2-connected graph
- On the surface duality of linear graphs
- The Genus, Regional Number, and Betti Number of a Graph
- Theory of Matroids
Cited in
(3)
This page was built for publication: Matroids Determine the Embeddability of Graphs in Surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3828019)
