Polychromatic Hamilton cycles
From MaRDI portal
Publication:685588
DOI10.1016/0012-365X(93)90054-WzbMath0803.05036WikidataQ57401590 ScholiaQ57401590MaRDI QIDQ685588
Publication date: 17 October 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)
Related Items (25)
Zeons, orthozeons, and graph colorings ⋮ Polychromatic cliques ⋮ Rainbow triangles in arc-colored digraphs ⋮ Elegantly Colored Paths and Cycles in Edge Colored Random Graphs ⋮ Properly coloured copies and rainbow copies of large graphs with small maximum degree ⋮ Rainbow Hamilton cycles and lopsidependency ⋮ Sub-Ramsey numbers for matchings ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs ⋮ Long directed rainbow cycles and rainbow spanning trees ⋮ Long rainbow paths and rainbow cycles in edge colored graphs. A survey ⋮ Labeled traveling salesman problems: complexity and approximation ⋮ Color degree and heterochromatic cycles in edge-colored graphs ⋮ A rainbow blow‐up lemma ⋮ Anti-Ramsey properties of random graphs ⋮ On Hamiltonian Berge cycles in [3-uniform hypergraphs] ⋮ Color degree condition for long rainbow paths in edge-colored graphs ⋮ Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey ⋮ Complexity of Computing the Anti-Ramsey Numbers for Paths. ⋮ The heterochromatic cycles in edge-colored graphs ⋮ Almost spanning subgraphs of random graphs after adversarial edge removal ⋮ Disproof of a conjecture on the rainbow triangles in arc-colored digraphs ⋮ Extensions of results on rainbow Hamilton cycles in uniform hypergraphs ⋮ Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs ⋮ Rainbow \(C_4\)'s and directed \(C_4\)'s: the bipartite case study
Cites Work
This page was built for publication: Polychromatic Hamilton cycles
