The chromatic index of a graph whose core has maximum degree two

DOI10.1016/0012-365X(92)90598-AzbMath0772.05041OpenAlexW1978703419MaRDI QIDQ1197023

Zhao Cheng, Anthony J. W. Hilton

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90598-a

zbMATH Keywords

chromatic indexodd cyclemaximum degreecritical graphedge-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (13)

Unnamed Item ⋮ On the size of graphs of class 2 whose cores have maximum degree two ⋮ Edge-colouring graphs with bounded local degree sums ⋮ The core conjecture of Hilton and Zhao ⋮ Some criteria for a graph to be class 1 ⋮ Clique-perfectness of complements of line graphs ⋮ Decompositions for edge-coloring join graphs and cobipartite graphs ⋮ The spectral radius of edge chromatic critical graphs ⋮ The chromatic index of a graph whose core is a cycle of order at most 13 ⋮ Clique-perfectness of complements of line graphs ⋮ The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4 ⋮ Rough isometry and the asymptotic Dirichlet problem ⋮ The chromatic index of a claw-free graph whose core has maximum degree 2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the \(\Delta\)-subgraph of graphs which are critical with respect to the chromatic index
• The edge-chromatic class of regular graphs of degree 4 and their complements
• Recent progress on edge-colouring graphs
• 1-factorizing regular graphs of high degree - an improved bound
• Two conjectures on edge-colouring
• On Hamilton's ideals
• Regular Graphs of High Degree are 1-Factorizable

This page was built for publication: The chromatic index of a graph whose core has maximum degree two