Vertex-splitting and chromatic index critical graphs

DOI10.1016/S0166-218X(96)00125-4zbMath0882.05060OpenAlexW2083614889MaRDI QIDQ1363752

Anthony J. W. Hilton, Cheng Zhao

Publication date: 11 August 1997

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

splittingedge-colouringoverfull conjecturechromatic index critical graphoverfull graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

An improvement to the Hilton-Zhao vertex-splitting conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Critical star multigraphs
• Recent progress on edge-colouring graphs
• 1-factorizing regular graphs of high degree - an improved bound
• Two conjectures on edge-colouring
• How to find overfull subgraphs in graphs with large maximum degree
• On Hamilton's ideals
• Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
• The NP-Completeness of Edge-Coloring
• A construction of chromatic index critical graphs
• Regular Graphs of High Degree are 1-Factorizable

This page was built for publication: Vertex-splitting and chromatic index critical graphs