Edge-disjoint rainbow spanning trees in complete graphs
From MaRDI portal
Publication:298338
DOI10.1016/j.ejc.2016.04.003zbMath1339.05053OpenAlexW2353770281MaRDI QIDQ298338
Stephen G. Hartke, James M. Carraher, Paul S. Horn
Publication date: 20 June 2016
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2016.04.003
Related Items (21)
On the number of rainbow spanning trees in edge-colored complete graphs ⋮ Rainbow spanning trees in properly coloured complete graphs ⋮ The rainbow Steiner tree problem ⋮ Two heuristics for the rainbow spanning forest problem ⋮ Edge-disjoint rainbow trees in properly coloured complete graphs ⋮ Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs ⋮ Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs ⋮ Unnamed Item ⋮ On the complexity of packing rainbow spanning trees ⋮ Quaternionic 1-factorizations and complete sets of rainbow spanning trees ⋮ Unnamed Item ⋮ Decompositions into isomorphic rainbow spanning trees ⋮ Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations ⋮ Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees ⋮ Linearly many rainbow trees in properly edge-coloured complete graphs ⋮ On heterochromatic out-directed spanning trees in tournaments ⋮ The rainbow spanning forest problem ⋮ An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles ⋮ Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees ⋮ Special case of Rota's basis conjecture on graphic matroids ⋮ $(g,f)$-Chromatic spanning trees and forests
Cites Work
- Unnamed Item
- Unnamed Item
- On rainbow trees and cycles
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Multicoloured Hamilton cycles
- A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
- Convex Optimization in Normed Spaces
- Spanning trees with many or few colors in edge-colored graphs
- Rainbow spanning trees in complete graphs colored by one‐factorizations
- Edge-Disjoint Isomorphic Multicolored Trees and Cycles in Complete Graphs
- Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Concentration of Measure for the Analysis of Randomized Algorithms
- Multicolored trees in complete graphs
- Multicolored trees in complete graphs
- Multicolored forests in complete bipartite graphs
This page was built for publication: Edge-disjoint rainbow spanning trees in complete graphs
