| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 870 2 |
| Ultima descărcare din IBN: 2017-04-28 10:21 |
| Căutarea după subiecte similare conform CZU |
| 004:519.179.1 (2) |
| Știința și tehnologia calculatoarelor. Calculatoare. Procesarea datelor (4156) |
| Analiză combinatorică. Teoria grafurilor (114) |
 SM ISO690:2012MATHEWS, Jeremy. Maximal induced colorable subhypergraphs of
all uncolorable BSTS(15)s. In: Computer Science Journal of Moldova, 2011, nr. 1(55), pp. 29-37. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Computer Science Journal of Moldova |
||||||
| Numărul 1(55) / 2011 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 004:519.179.1 | ||||||
| Pag. 29-37 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
A Bi-Steiner Triple System (BSTS) is a Steiner Triple System
with vertices colored in such a way that the vertices of each block
receive precisely two colors. When we consider all BSTS(15)s as
mixed hypergraphs, we find that some are colorable while others
are uncolorable. The criterion for colorability for a BSTS(15)
by Rosa is containing BSTS(7) as a subsysytem. Of the 80 non-
isomorphic BSTS(15)s, only 23 meet this criterion and are therefore colorable. The other 57 are uncolorable. The question arose
of finding maximal induced colorable subhypergraphs of these 57
uncolorable BSTS(15)s. This paper gives feasible partitions of
maximal induced colorable subhypergraphs of each uncolorable
BSTS(15). |
||||||
|
|
|
|
