Spanning tree decompositions of complete graphs orthogonal to rotational 1-factorizations

DOI10.1007/s00373-017-1766-7zbMath1368.05020OpenAlexW2570300194WikidataQ114229657 ScholiaQ114229657MaRDI QIDQ2014215

James Mahoney, John Krussel, John S. IV. Caughman

Publication date: 10 August 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-017-1766-7

zbMATH Keywords

matchingspanning tree1-factorizationcomplete graph

Mathematics Subject Classification ID

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

Related Items (3)

Unnamed Item ⋮ Quaternionic 1-factorizations and complete sets of rainbow spanning trees ⋮ Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations

Cites Work

• \(k\)-pyramidal one-factorizations
• One-factorizations of the complete graph—A survey
• Multicolored trees in complete graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Spanning tree decompositions of complete graphs orthogonal to rotational 1-factorizations