Multi-Coloured Hamilton Cycles in Random Edge-Coloured Graphs

DOI10.1017/S0963548301005004zbMATH Open1002.05019WikidataQ57401525 ScholiaQ57401525MaRDI QIDQ3147274FDOQ3147274

Authors: Colin Cooper, Alan Frieze 

Publication date: 5 January 2003

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Recommendations

• Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold
• Rainbow matchings and Hamilton cycles in random graphs
• Rainbow Hamilton cycles in random graphs and hypergraphs
• Colorful Hamilton Cycles in Random Graphs
• Color‐biased Hamilton cycles in random graphs

zbMATH Keywords

random graphHamilton cyclerainbow colouringmulti-colouring

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Eulerian and Hamiltonian graphs (05C45) Coloring of graphs and hypergraphs (05C15)

Cited In (14)

• Elegantly colored paths and cycles in edge colored random graphs
• Pattern colored Hamilton cycles in random graphs
• Rainbow arborescence in random digraphs
• Anti-Ramsey properties of random graphs
• Colorful Hamilton Cycles in Random Graphs
• Rainbow thresholds
• Power of \(k\) choices and rainbow spanning trees in random graphs
• On rainbow Hamilton cycles in random hypergraphs
• Rainbow Hamilton cycles in random graphs
• Packing directed Hamilton cycles online
• Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\)
• Universality of random graphs and rainbow embedding
• Rainbow Hamilton cycles and lopsidependency
• Color‐biased Hamilton cycles in random graphs

This page was built for publication: Multi-Coloured Hamilton Cycles in Random Edge-Coloured Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147274)