Pages that link to "Item:Q1088687"
From MaRDI portal
The following pages link to Path and cycle sub-Ramsey numbers and an edge-colouring conjecture (Q1088687):
Displaying 40 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)
- Rainbow generalizations of Ramsey theory: A survey (Q604649) (← links)
- Polychromatic Hamilton cycles (Q685588) (← 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)
- On the approximability of the minimum rainbow subgraph problem and other related problems (Q1679237) (← links)
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles (Q1686315) (← 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)
- Better lower and upper bounds for the minimum rainbow subgraph problem (Q2250438) (← 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)
- Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs (Q2346583) (← links)
- A generalization of heterochromatic graphs and \(f\)-chromatic spanning forests (Q2376091) (← links)
- Rainbow Hamilton cycles and lopsidependency (Q2400558) (← links)
- Bounded colorings of multipartite graphs and hypergraphs (Q2403698) (← links)
- Long rainbow paths and rainbow cycles in edge colored graphs. A survey (Q2422839) (← links)
- Rainbow Ramsey simple structures (Q2629299) (← links)
- Sub-Ramsey numbers for matchings (Q2657039) (← links)
- Almost all optimally coloured complete graphs contain a rainbow Hamilton path (Q2673480) (← links)
- Compatible Hamilton cycles in random graphs (Q2830238) (← 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)
- Rainbow and orthogonal paths in factorizations of<i>K</i><i>n</i> (Q3576975) (← links)
- On an anti‐Ramsey property of Ramanujan graphs (Q4845079) (← links)
- A rainbow blow‐up lemma (Q5128752) (← links)
- A Rainbow Dirac's Theorem (Q5130574) (← links)
- A counterexample to Stein’s Equi-$n$-square Conjecture (Q5377048) (← links)
- Rainbow hamilton cycles in random graphs (Q5415595) (← links)
- Properly colored and rainbow copies of graphs with few cherries (Q5890911) (← links)
- Color degree condition for long rainbow paths in edge-colored graphs (Q5964923) (← links)