| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 837 2 |
| Ultima descărcare din IBN: 2017-04-28 11:55 |
| Căutarea după subiecte similare conform CZU |
| 519.1+519.179.1 (1) |
| Analiză combinatorică. Teoria grafurilor (114) |
 SM ISO690:2012MATHEWS, Jeremy, TOLBERT, Brett. All proper colorings of every colorable BSTS(15). In: Computer Science Journal of Moldova, 2010, nr. 1(52), pp. 41-53. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Computer Science Journal of Moldova |
||||||
| Numărul 1(52) / 2010 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 519.1+519.179.1 | ||||||
| Pag. 41-53 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
A Steiner System, denoted S(t; k; v), is a vertex set X containing v vertices, and a collection of subsets of X of size k, called
blocks, such that every t vertices from X are in exactly one of
the blocks. A Steiner Triple System, or STS, is a special case of
a Steiner System where t = 2, k = 3 and v = 1 or 3 (mod6) [7].
A Bi-Steiner Triple System, or BSTS, is a Steiner Triple System
with the vertices colored in such a way that each block of vertices
receives precisely two colors. Out of the 80 BSTS(15)s, only 23
are colorable [1]. In this paper, using a computer program that
we wrote, we give a complete description of all proper colorings,
all feasible partitions, chromatic polynomial and chromatic spectrum of every colorable BSTS(15). |
||||||
|
|
|
|
