Chromatic index critical graphs of even order with five major vertices
From MaRDI portal
Publication:2484161
DOI10.1007/s00373-005-0610-7zbMath1065.05043OpenAlexW2070656265MaRDI QIDQ2484161
Publication date: 28 July 2005
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-005-0610-7
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items
On the size of graphs of class 2 whose cores have maximum degree two ⋮ Some criteria for a graph to be class 1 ⋮ The spectral radius of edge chromatic critical graphs ⋮ The chromatic index of a graph whose core is a cycle of order at most 13 ⋮ An application of Tutte's theorem to 1-factorization of regular graphs of high degree ⋮ The chromatic index of a claw-free graph whose core has maximum degree 2