Rainbow numbers for cycles with pendant edges
From MaRDI portal
Publication:1014810
DOI10.1007/S00373-008-0786-8zbMath1180.05070OpenAlexW2052790335MaRDI QIDQ1014810
Publication date: 29 April 2009
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-008-0786-8
Related Items (11)
Anti-Ramsey numbers in complete split graphs ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ Rainbow numbers for graphs containing small cycles ⋮ Anti-Ramsey number of matchings in a hypergraph ⋮ Monochromatic stars in rainbow \(K_3\)-free and \(S_3^+\)-free colorings ⋮ A note on the monotonicity of mixed Ramsey numbers ⋮ Anti-Ramsey numbers for disjoint copies of graphs ⋮ Rainbow triangles in edge-colored Kneser graphs ⋮ Anti-Ramsey number of triangles in complete multipartite graphs ⋮ Rainbow numbers for cycles with pendant edges ⋮ Rainbow Numbers for Cycles in Plane Triangulations
Cites Work
- Arc coverings of graphs
- Rainbow numbers for cycles with pendant edges
- Edge-colorings of complete graphs that avoid polychromatic trees
- Edge-colorings with no large polychromatic stars
- Anti-Ramsey numbers of subdivided graphs
- Rainbow numbers for matchings and complete graphs
- An anti-Ramsey theorem on cycles
- Rainbow numbers for small stars with one edge added
- On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
- On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
- Unnamed Item
- Unnamed Item
This page was built for publication: Rainbow numbers for cycles with pendant edges
