A 1-factorization of the line graphs of complete graphs

DOI10.1002/JGT.3190060408MaRDI QIDQ3968968zbMATH OpenOpenAlexFDO

Authors Brian Alspach

Publication date 1982

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190060408

zbMATH Keywords

1-factorizationline graphpartition of the complete graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• Every generalized Petersen graph has a Tait coloring

Cited in

(5)

• The 1-factorization of some line-graphs
• Eulerian cycle decomposition conjecture for the line graph of complete graphs
• Brian Alspach and his work
• The chromatic index of strongly regular graphs
• Covering 2-paths uniformly

This page was built for publication: A 1-factorization of the line graphs of complete graphs

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