Rainbow spanning trees in complete graphs colored by one‐factorizations

DOI10.1002/jgt.22160zbMath1386.05027OpenAlexW2616445782WikidataQ114236160 ScholiaQ114236160MaRDI QIDQ4638631

Paul S. Horn

Publication date: 27 April 2018

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

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

zbMATH Keywords

one-factorizationsrainbow spanning trees

Mathematics Subject Classification ID

Trees (05C05)

Related Items (13)

Edge-disjoint rainbow spanning trees in complete graphs ⋮ On the number of rainbow spanning trees in edge-colored complete graphs ⋮ Maximum properly colored trees in edge-colored graphs ⋮ Rainbow spanning trees in properly coloured complete graphs ⋮ Unnamed Item ⋮ On the complexity of packing rainbow spanning trees ⋮ Quaternionic 1-factorizations and complete sets of rainbow spanning trees ⋮ Unnamed Item ⋮ Decompositions into isomorphic rainbow spanning trees ⋮ Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations ⋮ Linearly many rainbow trees in properly edge-coloured complete graphs ⋮ An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles ⋮ $(g,f)$-Chromatic spanning trees and forests

This page was built for publication: Rainbow spanning trees in complete graphs colored by one‐factorizations