Upper bounds on the maximum degree of class two graphs on surfaces

DOI10.1016/j.disc.2019.111738zbMath1431.05069OpenAlexW2990856877MaRDI QIDQ2286600

Yue Zhao, Rong Luo, Katie Horacek, Zheng-Ke Miao

Publication date: 22 January 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2019.111738

zbMATH Keywords

surfacescritical graphsedge coloringsclass oneclass two

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian cycles in critical graphs with large maximum degree
• The chromatic index of graphs with large maximum degree
• Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\)
• Orientable triangular embeddings of K\(_{18}\)-K\(_3\) and K\(_{13}\)-K\(_3\)
• 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
• Hamiltonicity of edge-chromatic critical graphs
• Finding \(\Delta (\Sigma)\) for a surface \(\Sigma \) of characteristic \(-6\) and \(-7\)
• The chromatic class and the location of a graph on a closed surface
• Finding Δ(Σ) for a Surface Σ of Characteristic −4
• Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = −5
• The size of edge chromatic critical graphs with maximum degree 6
• The chromatic index of graphs with a spanning star
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Every planar graph with maximum degree 7 is of class 1