Pages that link to "Item:Q298338"
From MaRDI portal
The following pages link to Edge-disjoint rainbow spanning trees in complete graphs (Q298338):
Displaying 29 items.
- Rainbow spanning subgraphs of small diameter in edge-colored complete graphs (Q292270) (← links)
- 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)
- Rainbow and properly colored spanning trees in edge-colored bipartite graphs (Q2051897) (← links)
- Special case of Rota's basis conjecture on graphic matroids (Q2088711) (← links)
- Two heuristics for the rainbow spanning forest problem (Q2184043) (← links)
- Long directed rainbow cycles and rainbow spanning trees (Q2189824) (← 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 \(t\) edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees (Q2811196) (← links)
- Rainbow spanning trees in complete graphs colored by one‐factorizations (Q4638631) (← links)
- On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph (Q4643315) (← links)
- An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles (Q4960448) (← links)
- Decompositions into spanning rainbow structures (Q4973646) (← links)
- (Q5000298) (← links)
- Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees (Q5139656) (← links)
- $(g,f)$-Chromatic spanning trees and forests (Q5197593) (← links)
- Multicolored trees in complete graphs (Q5898715) (← links)
- On heterochromatic out-directed spanning trees in tournaments (Q5964994) (← links)
- Rainbow trees in uniformly edge‐colored graphs (Q6074865) (← links)
- Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs (Q6100615) (← links)
- An extremal problem on rainbow spanning trees in graphs (Q6134934) (← links)