Multicolored trees in complete graphs
From MaRDI portal
Publication:5904060
DOI10.1006/jctb.1996.0071zbMath0861.05020MaRDI QIDQ5904060
Susan Hollingsworth, Richard A. Brualdi
Publication date: 8 December 1996
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1996.0071
partition; edge-coloring; complete graph; perfect matchings; one-factorization; multicolored spanning trees
05C05: Trees
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C15: Coloring of graphs and hypergraphs
Related Items
Unnamed Item, An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles, Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$, Rainbow structures in locally bounded colorings of graphs, $(g,f)$-Chromatic spanning trees and forests, Unnamed Item, Edge-disjoint rainbow spanning trees in complete graphs, Sufficient conditions for the existence of spanning colored trees in edge-colored graphs, Linearly many rainbow trees in properly edge-coloured complete graphs, Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey, Multicolored parallelisms of Hamiltonian cycles, On the number of rainbow spanning trees in edge-colored complete graphs, Rainbow spanning trees in properly coloured complete graphs, Edge-disjoint rainbow trees in properly coloured complete graphs, Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations, Spanning tree decompositions of complete graphs orthogonal to rotational 1-factorizations, On the number of heterochromatic trees in nice and beautiful colorings of complete graphs, Special case of Rota's basis conjecture on graphic matroids, Maximum properly colored trees in edge-colored graphs, Decompositions into isomorphic rainbow spanning trees, Properly colored spanning trees in edge-colored graphs, Maximum colored trees in edge-colored graphs, A generalization of heterochromatic graphs and \(f\)-chromatic spanning forests, On the minimum monochromatic or multicolored subgraph partition problems, A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph, Almost all optimally coloured complete graphs contain a rainbow Hamilton path, On the complexity of packing rainbow spanning trees, Quaternionic 1-factorizations and complete sets of rainbow spanning trees, Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees
