Cites work
- k-Degenerate Graphs
- A 4-Color Theorem for Toroidal Graphs
- A Generalization of the 5-Color Theorem
- A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\)
- A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
- An Analogue to the Heawood Map-Colouring Problem
- Chromatic number and girth
- Chromatic number and skewness
- Critical Point-Arboritic Graphs
- Das Geschlecht des vollständigen paaren Graphen
- Der vollständige paare Graph auf nichtorientierbaren Flächen.
- Excess in critical graphs
- Grötzsch's theorem on 3-colorings
- Heawood's theorem and connectivity
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3394167 (Why is no real title available?)
- Point Partition Numbers and Girth
- Point-Arboricity and Girth
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- The Point Partition Numbers of Closed 2-Manifolds
- The Point-Arboricity of Planar Graphs
This page was built for publication: Some results in topological graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1241523)