The edge-chromatic class of regular graphs of degree 4 and their complements

DOI10.1016/0166-218X(87)90069-2zbMath0612.05029WikidataQ59233690 ScholiaQ59233690MaRDI QIDQ1087882

Anthony J. W. Hilton, Amanda G. Chetwynd

Publication date: 1987

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

zbMATH Keywords

regular graphsedge-colouring1-factorization

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items

Two conjectures on edge-colouring, The chromatic index of a graph whose core has maximum degree two, Unextendible product bases and 1-factorization of complete graphs, An application of Tutte's theorem to 1-factorization of regular graphs of high degree

Cites Work

• Unnamed Item
• Unnamed Item
• Premature sets of 1-factors or how not to schedule round robin tournaments
• On Hamilton's ideals
• Regular Graphs of High Degree are 1-Factorizable
• Some Theorems on Abstract Graphs