Pages that link to "Item:Q4638631"
From MaRDI portal
The following pages link to Rainbow spanning trees in complete graphs colored by one‐factorizations (Q4638631):
Displaying 17 items.
- Edge-disjoint rainbow spanning trees in complete graphs (Q298338) (← 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)
- Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations (Q1727772) (← links)
- Rainbow and properly colored spanning trees in edge-colored bipartite graphs (Q2051897) (← links)
- Maximum properly colored trees in edge-colored graphs (Q2168717) (← links)
- Decompositions into isomorphic rainbow spanning trees (Q2221934) (← links)
- On the complexity of packing rainbow spanning trees (Q2685331) (← links)
- Quaternionic 1-factorizations and complete sets of rainbow spanning trees (Q2689122) (← links)
- On the existence of rainbows in 1-factorizations of \(K_{2n}\) (Q4222172) (← links)
- An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles (Q4960448) (← links)
- Decompositions into spanning rainbow structures (Q4973646) (← links)
- (Q5000298) (← links)
- Rainbow structures in locally bounded colorings of graphs (Q5128755) (← links)
- $(g,f)$-Chromatic spanning trees and forests (Q5197593) (← links)
- An extremal problem on rainbow spanning trees in graphs (Q6134934) (← links)