Pages that link to "Item:Q1690046"
From MaRDI portal
The following pages link to Edge-disjoint rainbow trees in properly coloured complete graphs (Q1690046):
Displaying 12 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)
- 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)
- Rainbow and properly colored spanning trees in edge-colored bipartite graphs (Q2051897) (← links)
- Embedding rainbow trees with applications to graph labelling and decomposition (Q2216732) (← links)
- Decompositions into isomorphic rainbow spanning trees (Q2221934) (← links)
- Rainbow spanning trees in complete graphs colored by one‐factorizations (Q4638631) (← links)
- Rainbow structures in locally bounded colorings of graphs (Q5128755) (← links)
- Lower bounds for rainbow Tur\'{a}n numbers of paths and other trees (Q5139689) (← links)