Edge-Disjoint Isomorphic Multicolored Trees and Cycles in Complete Graphs

DOI10.1137/S0895480101397402zbMath1069.05032OpenAlexW1966567132MaRDI QIDQ5317571

Gregory M. Constantine

Publication date: 16 September 2005

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

Full work available at URL: https://doi.org/10.1137/s0895480101397402

zbMATH Keywords

orthogonal Latin squaresproper coloringmulticolored spanning paths

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Edge-disjoint rainbow spanning trees in complete graphs ⋮ Almost all optimally coloured complete graphs contain a rainbow Hamilton path ⋮ On the complexity of packing rainbow spanning trees ⋮ Decompositions into isomorphic rainbow spanning trees ⋮ Multicolored parallelisms of Hamiltonian cycles

This page was built for publication: Edge-Disjoint Isomorphic Multicolored Trees and Cycles in Complete Graphs