1-factorization of regular graphs by colour exchange

DOI10.1112/JLMS/JDM117MaRDI QIDQ5460408zbMATH OpenOpenAlexFDO

Authors D. Cariolaro

Publication date 5 May 2008

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/jlms/jdm117

Mathematics Subject Classification ID

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

Recommendations

• Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs
• Factor d-domatic colorings of graphs
• scientific article; zbMATH DE number 4145942
• Vertex-regular 1-factorizations of the complete graph
• Publication:4489800
• Chromatic factorizations of a graph
• scientific article; zbMATH DE number 1491625
• scientific article; zbMATH DE number 1008448
• scientific article; zbMATH DE number 6843209
• scientific article; zbMATH DE number 3877223

Cited in

(1)

• On Vizing's edge colouring question

This page was built for publication: 1-factorization of regular graphs by colour exchange

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5460408)