Anti-Ramsey colorings in several rounds
type: Item
instance of: scholarly article
title: Anti-Ramsey colorings in several rounds
zbMATH Open document ID: 1024.05061
author: Miklós Ruszinkó
author: Aart Blokhuis
author: Ralph Faudree
author: András Gyárfás
published in: Journal of Combinatorial Theory. Series B
publication date: 2002-12-10T00:00:00Z
Mathematics Subject Classification ID: 05C55
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1843756
MaRDI profile type: Publication
OpenAlex ID: W2112475468
cites work: Q3998644
cites work: On coloring graphs to maximize the proportion of multicolored k-edges
cites work: Q4075490
cites work: On the Size of Separating Systems and Families of Perfect Hash Functions
cites work: Q3715120
cites work: New bounds for perfect hashing via information theory
cites work: Q4878288
cites work: One-factorizations of the complete graph—A survey
cites work: On restricted colourings of \(K_ n\)
DOI: 10.1006/JCTB.2000.2016
Recommended article: Q4470362
Recommended article: A bound for multicolor Ramsey numbers
Recommended article: Anti-Ramsey Multiplicities
Recommended article: On the multi-colored Ramsey numbers of cycles
Recommended article: Multicolor Ramsey numbers via pseudorandom graphs
Recommended article: Anti-Ramsey coloring for matchings in complete bipartite graphs
Recommended article: Multicolor Ramsey numbers for some paths and cycles
Recommended article: Multi-color Ramsey numbers of even cycles
Recommended article: Multicolor Ramsey Numbers for Paths and Cycles
Recommended article: Q3137169
description: scientific article; zbMATH DE number 1843756