The following pages link to Polychromatic Hamilton cycles (Q685588):
Displaying 36 items.
- Rainbow \(C_4\)'s and directed \(C_4\)'s: the bipartite case study (Q262974) (← links)
- Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs (Q383748) (← links)
- Color the cycles (Q383778) (← links)
- Color degree and heterochromatic cycles in edge-colored graphs (Q449221) (← links)
- Rainbow generalizations of Ramsey theory: A survey (Q604649) (← links)
- On a problem of G. Hahn about coloured Hamiltonian paths in \(K_{2n}\) (Q800377) (← links)
- Anti-Ramsey properties of random graphs (Q965256) (← links)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) (← links)
- The heterochromatic cycles in edge-colored graphs (Q1032004) (← links)
- Multicolored parallelisms of Hamiltonian cycles (Q1044961) (← links)
- Properly coloured Hamiltonian cycles in edge-coloured complete graphs (Q1677578) (← links)
- Polychromatic cliques (Q1877677) (← links)
- Multicoloured Hamilton cycles (Q1890827) (← links)
- Labeled traveling salesman problems: complexity and approximation (Q1952507) (← links)
- A note on equitable Hamiltonian cycles (Q1983122) (← links)
- On Hamiltonian Berge cycles in [3]-uniform hypergraphs (Q2032885) (← links)
- Disproof of a conjecture on the rainbow triangles in arc-colored digraphs (Q2097174) (← links)
- Rainbow triangles in arc-colored digraphs (Q2127620) (← links)
- Polychromatic colorings of 1-regular and 2-regular subgraphs of complete graphs (Q2142635) (← links)
- Long directed rainbow cycles and rainbow spanning trees (Q2189824) (← links)
- Extensions of results on rainbow Hamilton cycles in uniform hypergraphs (Q2345522) (← links)
- Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs (Q2346583) (← links)
- Zeons, orthozeons, and graph colorings (Q2361423) (← links)
- Rainbow Hamilton cycles and lopsidependency (Q2400558) (← links)
- Long rainbow paths and rainbow cycles in edge colored graphs. A survey (Q2422839) (← links)
- Sub-Ramsey numbers for matchings (Q2657039) (← links)
- Totally multicoloured cycles (Q2816124) (← links)
- Almost spanning subgraphs of random graphs after adversarial edge removal (Q2840559) (← links)
- Properly coloured copies and rainbow copies of large graphs with small maximum degree (Q2904592) (← links)
- Elegantly Colored Paths and Cycles in Edge Colored Random Graphs (Q3174699) (← links)
- Cycles of given color patterns (Q4865523) (← links)
- Complexity of Computing the Anti-Ramsey Numbers for Paths. (Q5089164) (← links)
- A rainbow blow‐up lemma (Q5128752) (← links)
- Colorful Hamilton Cycles in Random Graphs (Q5883272) (← links)
- Color degree condition for long rainbow paths in edge-colored graphs (Q5964923) (← links)
- Approximating maximum edge 2-coloring by normalizing graphs (Q6574923) (← links)
