Rainbow numbers for certain graphs
From MaRDI portal
Publication:3439415
DOI10.1016/j.endm.2006.06.013zbMath1201.05064OpenAlexW2090451111MaRDI QIDQ3439415
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2006.06.013
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On restricted colourings of \(K_ n\)
- 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
- 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
This page was built for publication: Rainbow numbers for certain graphs