Pages that link to "Item:Q6074865"
From MaRDI portal
The following pages link to Rainbow trees in uniformly edge‐colored graphs (Q6074865):
Displaying 9 items.
- Edge-disjoint rainbow trees in properly coloured complete graphs (Q1690046) (← links)
- Rainbow and properly colored spanning trees in edge-colored bipartite graphs (Q2051897) (← links)
- Power of \(k\) choices and rainbow spanning trees in random graphs (Q2256126) (← links)
- Universality of random graphs and rainbow embedding (Q2811163) (← links)
- Coloring \(k\)-trees with forbidden monochrome or rainbow triangles (Q2820201) (← links)
- Rainbow arborescence in random digraphs (Q2833120) (← links)
- Multicolored trees in random graphs (Q4288877) (← links)
- Rainbow spanning trees in complete graphs colored by one‐factorizations (Q4638631) (← links)
- Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph (Q6612524) (← links)