SCOPUS 정보 검색 플랫폼

Volumn 6, Issue 1, 1999, Pages

Bicoloring Steiner triple systems

Author keywords

[No Author keywords available]

Indexed keywords

EID: 10044230633 PISSN: 10778926 EISSN: None Source Type: Journal
DOI: 10.37236/1457 Document Type: Article

Times cited : (40)

References (13)

1
- 0009763427
- Coloring Steiner triple systems
- M. de Brandes, K.T. Phelps, V. Rödl, Coloring Steiner triple systems, SIAM J. Alg. Disc. Meth. 3 (1982), 241-249.
- (1982) SIAM J. Alg. Disc. Meth. , vol.3 , pp. 241-249
- De Brandes, M.¹ Phelps, K.T.² Rödl, V.³

2
- 0003938168
- CRC Press, Inc.
- C. J. Colbourn and J. H. Dinitz, eds. The CRC Handbook of Combinatorial Designs, CRC Press, Inc., 1996.
- (1996) The CRC Handbook of Combinatorial Designs
- Colbourn, C.J.¹ Dinitz, J.H.²

3
- 0004118063
- Clarendon Press, Oxford
- C.J. Colbourn, A. Rosa, Triple Systems, Clarendon Press, Oxford, 1999.
- (1999) Triple Systems
- Colbourn, C.J.¹ Rosa, A.²

4
- 0013198916
- On the chromatic numbers of Steiner triple systems
- L. Haddad, On the chromatic numbers of Steiner triple systems, J. Combinat. Designs 7 (1999), 1-10.
- (1999) J. Combinat. Designs , vol.7 , pp. 1-10
- Haddad, L.¹

5
- 0000795368
- Upper chromatic number of Steiner triple and quadruple systems
- L. Milazzo, Zs. Tuza, Upper chromatic number of Steiner triple and quadruple systems, Discrete Math. 174 (1997), 247-259.
- (1997) Discrete Math. , vol.174 , pp. 247-259
- Milazzo, L.¹ Tuza, Zs.²

6
- 0001116526
- Strict colourings for classes of Steiner triple systems
- L. Milazzo, Zs. Tuza, Strict colourings for classes of Steiner triple systems, Discrete Math. 182 (1998), 233-243.
- (1998) Discrete Math. , vol.182 , pp. 233-243
- Milazzo, L.¹ Tuza, Zs.²

8
- 0013246165
- Steiner triple systems and their chromatic number
- A. Rosa, Steiner triple systems and their chromatic number, Acta Fac. Rer. Nat. Univer. Comen. Math. 24 (1970), 159-174.
- (1970) Acta Fac. Rer. Nat. Univer. Comen. Math. , vol.24 , pp. 159-174
- Rosa, A.¹

10
- 84968521851
- A combinatorial theorem with an application to Latin rectangles
- H.J. Ryser, A combinatorial theorem with an application to Latin rectangles, Proc. Amer. Math. Soc. 2 (1951), 550-552.
- (1951) Proc. Amer. Math. Soc. , vol.2 , pp. 550-552
- Ryser, H.J.¹

11
- 0000064131
- Hill-climbing algorithms for the construction of combinatorial designs
- D.R. Stinson, Hill-climbing algorithms for the construction of combinatorial designs, Ann. Discrete Math. 26 (1985), 321-334.
- (1985) Ann. Discrete Math. , vol.26 , pp. 321-334
- Stinson, D.R.¹

12
- 0001821089
- On the upper chromatic number of a hypergraph
- V.I. Voloshin, On the upper chromatic number of a hypergraph, Australas. J. Combin. 11 (1995), 25-45.
- (1995) Australas. J. Combin. , vol.11 , pp. 25-45
- Voloshin, V.I.¹

13
- 0002425708
- Equitable colorations of graphs
- D. de Werra, Equitable colorations of graphs, Rev. Francaise Automat. Informat. Rech. Oper. Ser. Rouge 3 (1971), 3-8.
- (1971) Rev. Francaise Automat. Informat. Rech. Oper. Ser. Rouge , vol.3 , pp. 3-8
- De Werra, D.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.