Pages that link to "Item:Q723883"
From MaRDI portal
The following pages link to Linearly many rainbow trees in properly edge-coloured complete graphs (Q723883):
Displaying 13 items.
- Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations (Q1727772) (← 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)
- Almost all optimally coloured complete graphs contain a rainbow Hamilton path (Q2673480) (← links)
- On the complexity of packing rainbow spanning trees (Q2685331) (← links)
- Quaternionic 1-factorizations and complete sets of rainbow spanning trees (Q2689122) (← links)
- An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles (Q4960448) (← links)
- (Q5000298) (← links)
- Color Isomorphic Even Cycles and a Related Ramsey Problem (Q5128499) (← links)
- A rainbow blow‐up lemma (Q5128752) (← links)
- Rainbow structures in locally bounded colorings of graphs (Q5128755) (← links)
- Repeated Patterns in Proper Colorings (Q5157390) (← links)
- $(g,f)$-Chromatic spanning trees and forests (Q5197593) (← links)
