Multicolored trees in complete graphs

DOI10.1006/JCTB.1996.0071MaRDI QIDQ5904060zbMATH OpenOpenAlexFDO

Authors Richard A. Brualdi, Susan Hollingsworth

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

zbMATH Keywords

complete graphedge-coloringmulticolored spanning treesone-factorizationpartitionperfect matchings

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Multicolored trees in complete graphs
• Multicolored Parallelisms of Isomorphic Spanning Trees
• scientific article; zbMATH DE number 1753164
• Multicolored isomorphic spanning trees in complete graphs.

Cited in

(42)

• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• Multicolored parallelisms of Hamiltonian cycles
• The color-degree matrix and the number of multicolored trees in star decompositions
• 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
• On multicolored forests in complete bipartite graphs
• 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
• Multitrees in random graphs
• 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
• Edge-disjoint rainbow spanning trees in complete graphs
• Uniform coloring of trees
• scientific article; zbMATH DE number 20509 (Why is no real title available?)
• scientific article; zbMATH DE number 1309149 (Why is no real title available?)
• Sufficient conditions for the existence of spanning colored trees in edge-colored graphs
• An algorithmic proof of the Lovász local lemma via resampling oracles
• Regular 1-factorizations of complete graphs and decompositions into pairwise isomorphic rainbow spanning trees
• 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
• Special monochromatic trees in two-colored complete graphs
• Multicolored Parallelisms of Isomorphic Spanning Trees
• Multicolored trees in complete graphs
• Multicolored forests in complete bipartite graphs
• Building graphs from colored trees
• scientific article; zbMATH DE number 7731161 (Why is no real title available?)
• Linearly many rainbow trees in properly edge-coloured complete graphs
• The parameterized complexity of the properly colored spanning tree problem
• A note on mixed tree coloring

This page was built for publication: Multicolored trees in complete graphs

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