Anti-Ramsey colorings in several rounds
From MaRDI portal
Publication:1850529
DOI10.1006/jctb.2000.2016zbMath1024.05061MaRDI QIDQ1850529
Ralph J. Faudree, Aart Blokhuis, Miklós Ruszinkó, András Gyárfás
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/735956a1afac7a9df5a9b666eac1c982e0db7464
Related Items
Cites Work
- On restricted colourings of \(K_ n\)
- New bounds for perfect hashing via information theory
- On the Size of Separating Systems and Families of Perfect Hash Functions
- One-factorizations of the complete graph—A survey
- On coloring graphs to maximize the proportion of multicolored k-edges
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item