Name
Abstract | ||
|---|---|---|
The upper chromatic number (chi) over bar (H) of a C-hypergraph H = (X, C) is the maximum number of colors that can be assigned to the vertices of H in such a way that each C is an element of C contains at least a monochromatic pair of vertices. This paper gives an upper bound for the upper chromatic number of Stiener triple systems of order n and proved that it is best possible for any n(equivalent to 1 or 3( mod 6)). |
Year | DOI | Venue |
|---|---|---|
2010 | null | ARS COMBINATORIA |
Keywords | Field | DocType |
C-hypergraph,upper chromatic number,Steiner triple systems | Discrete mathematics,Monad (category theory),Combinatorics,Chromatic scale,Mathematics | Journal |
Volume | Issue | ISSN |
97 | null | 0381-7032 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ping Zhao | 1 | 40 | 2.39 |
| Kefeng Diao | 2 | 36 | 5.29 |