On the size of graphs of class 2 whose cores have maximum degree two

DOI10.1007/S00373-012-1184-9zbMath1272.05051OpenAlexW2018191751MaRDI QIDQ367049

Zi-Xia Song, Khee Meng Koh

Publication date: 26 September 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1184-9

zbMATH Keywords

edge coloringchromatic indexoverfull

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small
• Chromatic index critical graphs of order 9
• The chromatic index of a graph whose core has maximum degree two
• On small graphs critical with respect to edge colourings
• Chromatic index critical graphs of even order with five major vertices
• A sufficient condition for a regular graph to be class 1
• Regular Graphs of High Degree are 1-Factorizable
• The Factorization of Linear Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the size of graphs of class 2 whose cores have maximum degree two