Pages that link to "Item:Q1637154"
From MaRDI portal
The following pages link to On the number of rainbow spanning trees in edge-colored complete graphs (Q1637154):
Displaying 16 items.
- Edge-disjoint rainbow spanning trees in complete graphs (Q298338) (← links)
- Sufficient conditions for the existence of spanning colored trees in edge-colored graphs (Q442397) (← links)
- Linearly many rainbow trees in properly edge-coloured complete graphs (Q723883) (← 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)
- A rainbow about \(T\)-colorings for complete graphs (Q1918544) (← links)
- Rainbow and properly colored spanning trees in edge-colored bipartite graphs (Q2051897) (← links)
- On the complexity of packing rainbow spanning trees (Q2685331) (← links)
- Multicolored isomorphic spanning trees in complete graphs. (Q2823226) (← links)
- Proof of a conjecture of Alan Hartman (Q4256102) (← links)
- Rainbow spanning trees in complete graphs colored by one‐factorizations (Q4638631) (← links)
- $(g,f)$-Chromatic spanning trees and forests (Q5197593) (← links)
- An extremal problem on rainbow spanning trees in graphs (Q6134934) (← links)
- A rainbow about T-colorings for complete graphs (Q6143976) (← links)
- The number of spanning trees in a superprism (Q6561584) (← links)