Pages that link to "Item:Q3816096"
From MaRDI portal
The following pages link to Hamilton circuits with many colours in properly edge-coloured complete graphs. (Q3816096):
Displayed 15 items.
- Rainbow Turán problems for paths and forests of stars (Q510352) (← links)
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles (Q1686315) (← links)
- Rainbow spanning trees in abelian groups (Q2159386) (← links)
- Long directed rainbow cycles and rainbow spanning trees (Q2189824) (← links)
- Embedding rainbow trees with applications to graph labelling and decomposition (Q2216732) (← links)
- Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs (Q2422235) (← links)
- Long rainbow paths and rainbow cycles in edge colored graphs. A survey (Q2422839) (← links)
- Almost all optimally coloured complete graphs contain a rainbow Hamilton path (Q2673480) (← links)
- Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP (Q4715273) (← links)
- Symmetric latin square and complete graph analogues of the evans conjecture (Q4764658) (← links)
- Rainbow Cycles in Flip Graphs. (Q5115806) (← links)
- A rainbow blow‐up lemma (Q5128752) (← links)
- Rainbow structures in locally bounded colorings of graphs (Q5128755) (← links)
- Rainbow Cycles in Flip Graphs (Q5208641) (← links)
- Hamilton transversals in random Latin squares (Q6074871) (← links)