Some results in topological graph theory
From MaRDI portal
Publication:1241523
DOI10.1007/BF02018409zbMath0365.05024MaRDI QIDQ1241523
Publication date: 1977
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Chromatic number and skewness
- Excess in critical graphs
- Chromatic number and girth
- Das Geschlecht des vollständigen paaren Graphen
- A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\)
- Grötzsch's theorem on 3-colorings
- A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
- A Generalization of the 5-Color Theorem
- Critical Point-Arboritic Graphs
- Point Partition Numbers and Girth
- Heawood's theorem and connectivity
- Point-Arboricity and Girth
- Der vollständige paare Graph auf nichtorientierbaren Flächen.
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- The Point-Arboricity of Planar Graphs
- An Analogue to the Heawood Map-Colouring Problem
- k-Degenerate Graphs
- A 4-Color Theorem for Toroidal Graphs
- The Point Partition Numbers of Closed 2-Manifolds