Concepedia
Discrete Mathematics · 2004 · 25 citations · 7 references
Open access
Natural SciencesComputer EngineeringColor TheoryGraph ColoringApproximation Algorithms For ColoringColoring Theorems
7
Decomposition of Km,n(Km,n∗) into cycles (circuits) of length 2k
Dominique Sotteau · Journal of Combinatorial Theory Series B · 1981 · 174 citations
Engineering, Computer Engineering, Circuit Theory +5
On the upper chromatic number of a hypergraph.
Vitaly Voloshin · 1995 · 141 citations
Natural Sciences, Mathematics, Combinatorics +5
Upper chromatic number of Steiner triple and quadruple systems
Lorenzo Milazzo, Źsolt Tuza · Discrete Mathematics · 1997 · 64 citations
Natural Sciences, Mathematics, Combinatorics +7
TRIPLE SYSTEMS (Oxford Mathematical Monographs)
Ian Anderson · Bulletin of the London Mathematical Society · 2000 · 56 citations
Natural Sciences, Mathematics, Dynamical Systems +3
Bicoloring Steiner Triple Systems
Charles J. Colbourn, Jeffrey H. Dinitz, Alexander Rosa · The Electronic Journal of Combinatorics · 1999 · 43 citations · Full text
Natural Sciences, Mathematics, Combinatorics +8