The following pages link to (Q3101000):
Displaying 12 items.
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles (Q1686315) (← links)
- Rainbow Hamiltonian cycles in strongly edge-colored graphs (Q1727799) (← links)
- Embedding rainbow trees with applications to graph labelling and decomposition (Q2216732) (← links)
- Rainbow vertex-pancyclicity of strongly edge-colored graphs (Q2219957) (← links)
- Some rainbow cycles in \(r\)-good edge-colorings (Q2286079) (← links)
- Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs (Q2346583) (← 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)
- Rainbow and orthogonal paths in factorizations of<i>K</i><i>n</i> (Q3576975) (← links)
- Hamilton transversals in random Latin squares (Q6074871) (← links)
- Transversal Hamilton cycle in hypergraph systems (Q6668348) (← links)
