Multicolored Isomorphic Spanning Trees in Complete Graphs
From MaRDI portal
Publication:2823226
zbMath1363.05022arXiv1410.0445MaRDI QIDQ2823226
Publication date: 6 October 2016
Full work available at URL: https://arxiv.org/abs/1410.0445
Trees (05C05) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (7)
On the number of rainbow spanning trees in edge-colored complete graphs ⋮ Unnamed Item ⋮ Quaternionic 1-factorizations and complete sets of rainbow spanning trees ⋮ 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 ⋮ $(g,f)$-Chromatic spanning trees and forests
This page was built for publication: Multicolored Isomorphic Spanning Trees in Complete Graphs
