The following pages link to (Q3672042):
Displaying 22 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 degree and heterochromatic cycles in edge-colored graphs (Q449221) (← links)
- Polychromatic Hamilton cycles (Q685588) (← links)
- Anti-Ramsey properties of random graphs (Q965256) (← links)
- On Erdős-Rado numbers (Q1842571) (← links)
- Polychromatic cliques (Q1877677) (← links)
- Labeled traveling salesman problems: complexity and approximation (Q1952507) (← links)
- On Hamiltonian Berge cycles in [3]-uniform hypergraphs (Q2032885) (← links)
- Rainbow pancyclicity in graph systems (Q2048556) (← links)
- Disproof of a conjecture on the rainbow triangles in arc-colored digraphs (Q2097174) (← links)
- Rainbow triangles in arc-colored digraphs (Q2127620) (← links)
- Long directed rainbow cycles and rainbow spanning trees (Q2189824) (← links)
- Power of \(k\) choices and rainbow spanning trees in random graphs (Q2256126) (← links)
- Extensions of results on rainbow Hamilton cycles in uniform hypergraphs (Q2345522) (← links)
- Long rainbow paths and rainbow cycles in edge colored graphs. A survey (Q2422839) (← links)
- Sub-Ramsey numbers for matchings (Q2657039) (← links)
- Elegantly Colored Paths and Cycles in Edge Colored Random Graphs (Q3174699) (← links)
- Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$ (Q5014139) (← links)
- A rainbow blow‐up lemma (Q5128752) (← links)
- A rainbow blow-up lemma for almost optimally bounded edge-colourings (Q5135407) (← links)
- Extremal Results for Berge Hypergraphs (Q5371028) (← links)
