A Sufficient Condition for a Graph to be the Core of a Class 2 Graph

DOI10.1017/S0963548300004211zbMath0963.05053OpenAlexW1976411826MaRDI QIDQ4496432

J. Keith Dugdale, Anthony J. W. Hilton

Publication date: 14 August 2000

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300004211

zbMATH Keywords

coreedge-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Some criteria for a graph to be class 1 ⋮ The chromatic index of a graph whose core is a cycle of order at most 13 ⋮ The chromatic index of a claw-free graph whose core has maximum degree 2

This page was built for publication: A Sufficient Condition for a Graph to be the Core of a Class 2 Graph