Pages that link to "Item:Q298338"

The following pages link to Edge-disjoint rainbow spanning trees in complete graphs (Q298338):

Displaying 20 items.

• Linearly many rainbow trees in properly edge-coloured complete graphs (Q723883) (← links)
• On the number of rainbow spanning trees in edge-colored complete graphs (Q1637154) (← links)
• Rainbow spanning trees in properly coloured complete graphs (Q1671318) (← links)
• Edge-disjoint rainbow trees in properly coloured complete graphs (Q1690046) (← links)
• Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations (Q1727772) (← links)
• The rainbow spanning forest problem (Q1797922) (← links)
• Special case of Rota's basis conjecture on graphic matroids (Q2088711) (← links)
• Two heuristics for the rainbow spanning forest problem (Q2184043) (← links)
• Decompositions into isomorphic rainbow spanning trees (Q2221934) (← links)
• Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs (Q2422235) (← links)
• The rainbow Steiner tree problem (Q2669791) (← links)
• On the complexity of packing rainbow spanning trees (Q2685331) (← links)
• Quaternionic 1-factorizations and complete sets of rainbow spanning trees (Q2689122) (← links)
• Anti-Ramsey Problems for <i>t</i> Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees (Q2811196) (← links)
• An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles (Q4960448) (← links)
• (Q5000298) (← links)
• Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees (Q5139656) (← links)
• $(g,f)$-Chromatic spanning trees and forests (Q5197593) (← links)
• On heterochromatic out-directed spanning trees in tournaments (Q5964994) (← links)
• Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs (Q6100615) (← links)