Cubic factorizations

DOI10.1016/J.DISC.2012.05.001zbMath1277.05142OpenAlexW4205268438WikidataQ114190747 ScholiaQ114190747MaRDI QIDQ383761

Moshe Rosenfeld, Vũ Đình Hòa

Publication date: 6 December 2013

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

Full work available at URL: https://doi.org/10.1016/j.disc.2012.05.001

zbMATH Keywords

edge coloringfactorizationgraph labelinggraph representation

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Factorizations of complete graphs into brooms
• Spanning cubic graph designs
• A quick proof that \(K_{10}\neq{}P+P+P\)
• Global constraints for round robin tournament scheduling.
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Zehnpunktige kubische Graphen
• A note on 3-factorizations of K10
• Cube factorizations of complete graphs
• One-factorizations of the complete graph—A survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cubic factorizations