Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\)
From MaRDI portal
Publication:933675
DOI10.1016/j.jctb.2007.11.002zbMath1148.05029MaRDI QIDQ933675
Publication date: 24 July 2008
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2007.11.002
05C35: Extremal problems in graph theory
05C10: Planar graphs; geometric and topological aspects of graph theory
Related Items
A sufficient condition for edge 6-colorable planar graphs with maximum degree 6, Upper bounds on the maximum degree of class two graphs on surfaces, Finding \(\Delta (\Sigma)\) for a surface \(\Sigma \) of characteristic \(-6\) and \(-7\), Finding Δ(Σ) for a Surface Σ of Characteristic −4, Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = −5
Cites Work
- Unnamed Item
- Chromatic index critical graphs of order 9
- On small graphs critical with respect to edge colourings
- Every planar map is four colorable. I: Discharging
- Chromatic-index-critical graphs of orders 11 and 12
- 3- and 4-critical graphs of small even order
- Coloring edges of graphs embedded in a surface of characteristic zero.
- Edge colorings of embedded graphs
- Edge colorings of graphs embeddable in a surface of low genus
- Planar graphs of maximum degree seven are Class I
- The chromatic class and the location of a graph on a closed surface
- Chromatic-index-critical graphs of orders 13 and 14
- Every Planar Map is Four Colorable
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- Every planar graph with maximum degree 7 is of class 1