Edge-Disjoint Isomorphic Multicolored Trees and Cycles in Complete Graphs

DOI10.1137/S0895480101397402MaRDI QIDQ5317571zbMATH OpenOpenAlexFDO

Authors 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

multicolored spanning pathsorthogonal Latin squaresproper coloring

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1753164
• Edge-colorings of \(K_{m,n}\) which forbid multicolored cycles
• Multicolored Parallelisms of Isomorphic Spanning Trees
• Colorful isomorphic spanning trees in complete graphs
• Multicolored isomorphic spanning trees in complete graphs.

Cited in

(12)

• Multicolored parallelisms of Hamiltonian cycles
• Edge-disjoint rainbow trees in properly coloured complete graphs
• Polychromatic colorings of 1-regular and 2-regular subgraphs of complete graphs
• Decompositions into isomorphic rainbow spanning trees
• Colorful isomorphic spanning trees in complete graphs
• Almost all optimally coloured complete graphs contain a rainbow Hamilton path
• On the complexity of packing rainbow spanning trees
• Multicolored spanning subgraphs in G-colorings of complete graphs.
• Edge-disjoint rainbow spanning trees in complete graphs
• scientific article; zbMATH DE number 1753164 (Why is no real title available?)
• Repeated patterns in proper colorings
• Isomorphic edge disjoint subgraphs of hypergraphs

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

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