Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = −5
From MaRDI portal
Publication:3174244
DOI10.1002/jgt.20548zbMath1233.05091OpenAlexW2145553711MaRDI QIDQ3174244
Publication date: 12 October 2011
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20548
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
A note on the size of edge-chromatic 4-critical graphs, Hamiltonian cycles in critical graphs with large maximum degree, A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture, Finding \(\Delta (\Sigma)\) for a surface \(\Sigma \) of characteristic \(-6\) and \(-7\), Double Vizing fans in critical class two graphs, The average degree of edge chromatic critical graphs with maximum degree seven, On the average degree of edge chromatic critical graphs. II., On the average degree of edge chromatic critical graphs, Upper bounds on the maximum degree of class two graphs on surfaces, Finding Δ(Σ) for a Surface Σ of Characteristic −4
Cites Work
- Chromatic index critical graphs of order 9
- Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\)
- On small graphs critical with respect to edge colourings
- 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
- Chromatic-index-critical graphs of orders 13 and 14
- The size of edge chromatic critical graphs with maximum degree 6
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- Every planar graph with maximum degree 7 is of class 1
