The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4

DOI10.1137/18M117056XzbMath1419.05069arXiv1703.00959OpenAlexW2959787790WikidataQ123109261 ScholiaQ123109261MaRDI QIDQ5232150

Landon Rabern, Daniel W. Cranston

Publication date: 29 August 2019

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

Full work available at URL: https://arxiv.org/abs/1703.00959

zbMATH Keywords

edge-coloringclass 1overfull graphHilton-Zhao conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Special issue in honour of Landon Rabern ⋮ The core conjecture of Hilton and Zhao ⋮ Graph edge coloring: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• The chromatic index of a graph whose core has maximum degree two
• Méthode et théorème général de coloration des aretes d'un multigraphe
• On the chromatic index of almost all graphs
• Colouring the petals of a graph
• The NP-Completeness of Edge-Coloring
• Subcubic Edge‐Chromatic Critical Graphs Have Many Edges

This page was built for publication: The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4