-
1
-
-
0002051203
-
Coloring hypcrgraphs: A new approach to multi-user source coding, Part I, J. Combinatorics
-
Part II: 5 (3) (1980) 220-268
-
R. Ahlswede, Coloring hypcrgraphs: a new approach to multi-user source coding, Part I, J. Combinatorics, Inform. System Sci. 4 (I) (1979) 76-115; Part II: 5 (3) (1980) 220-268.
-
(1979)
Inform. System Sci.
, vol.4
, Issue.1
, pp. 76-115
-
-
Ahlswede, R.1
-
2
-
-
84972498411
-
Every planar map is four colorable, Part I: Discharging
-
K. Appel, W. Haken, Every planar map is four colorable, Part I: discharging, Illinois J. Math. 21 (1997) 429-490.
-
(1997)
Illinois J. Math.
, vol.21
, pp. 429-490
-
-
Appel, K.1
Haken, W.2
-
3
-
-
84972500815
-
Every planar map is four colorable, Part II: Reducibility
-
K. Appel, W. Haken, J. Koch, Every planar map is four colorable, Part II: reducibility, Illinois J. Math. 21 (1997) 491-567.
-
(1997)
Illinois J. Math.
, vol.21
, pp. 491-567
-
-
Appel, K.1
Haken, W.2
Koch, J.3
-
5
-
-
0025519305
-
A new table of constant weight codes
-
A.E. Brouwer, J.B. Shearer, N.J.A. Sloane, W.D. Smith, A new table of constant weight codes, IEEE Trans. Inform. Theory IT-36 (1990) 1334-1380.
-
(1990)
IEEE Trans. Inform. Theory IT-36
, pp. 1334-1380
-
-
Brouwer, A.E.1
Shearer, J.B.2
Sloane, N.J.A.3
Smith, W.D.4
-
8
-
-
0013229335
-
Towards a large set of Steiner quadruple systems
-
T. Etzion, A. Hartman, Towards a large set of Steiner quadruple systems, SIAM J. Discrete Math. 4 (1991) 182-195.
-
(1991)
SIAM J. Discrete Math.
, vol.4
, pp. 182-195
-
-
Etzion, T.1
Hartman, A.2
-
9
-
-
32544442751
-
The upper chromatic number of simple co-monostars, Anale stiintifice ale USM, Stiinte reale
-
E. Flocos, The upper chromatic number of simple co-monostars, Anale stiintifice ale USM, Stiinte reale, Chisinau, 1997, pp. 22-27.
-
(1997)
Chisinau
, pp. 22-27
-
-
Flocos, E.1
-
15
-
-
84992244339
-
-
Graphs Combin., to appear
-
T. Jiang, D. Mubayi, Zs. Tuza, V. Voloshin, D. West, The chromatic spectrum of mixed hypergraphs, Graphs Combin., to appear.
-
The Chromatic Spectrum of Mixed Hypergraphs
-
-
Jiang, T.1
Mubayi, D.2
Tuza, Z.3
Voloshin, V.4
West, D.5
-
16
-
-
38149146651
-
Algorithmic complexity of list colorings
-
J. Kratochvil, Zs. Tuza, Algorithmic complexity of list colorings, Discrete Appl. Math. 50 (1994) 297-302.
-
(1994)
Discrete Appl. Math.
, vol.50
, pp. 297-302
-
-
Kratochvil, J.1
Tuza, Z.2
-
17
-
-
0002309317
-
New trends in the theory of graph colorings: Choosability and list colorings
-
R.L. Graham et al. (Eds.), American Mathematical Society, Providence, RI
-
J. Kratochvil, Zs. Tuza, M. Voigt, New trends in the theory of graph colorings: choosability and list colorings, in: R.L. Graham et al. (Eds.), Contemporary Trends in Discrete Mathematics, DIMACS Series in Discrete Mathematics and Theoretical Computer Sciences, Vol. 49, American Mathematical Society, Providence, RI, 1999, pp. 183-197.
-
(1999)
Contemporary Trends in Discrete Mathematics, DIMACS Series in Discrete Mathematics and Theoretical Computer Sciences
, vol.49
, pp. 183-197
-
-
Kratochvil, J.1
Tuza, Z.2
Voigt, M.3
-
19
-
-
0001879704
-
Coverings and colorings of hypergraphs
-
L. Lovâsz. Coverings and colorings of hypergraphs, Congr. Num. 8 (1973) 3-12.
-
(1973)
Congr. Num.
, vol.8
, pp. 3-12
-
-
Lovâsz, L.1
-
20
-
-
0012173372
-
Integer programming models for colorings of mixed hypergraphs
-
D. Lozovanu, V. Voloshin, Integer programming models for colorings of mixed hypergraphs, Comput. Sci. J. Moldova 8 (1)(22) (2000) 64-74.
-
(2000)
Comput. Sci. J. Moldova
, vol.8
, Issue.1-22
, pp. 64-74
-
-
Lozovanu, D.1
Voloshin, V.2
-
21
-
-
0000381288
-
On upper chromatic number for SQS(10) and SQS(16)
-
L. Milazzo, On upper chromatic number for SQS(10) and SQS(16), Le Matematiche L-Fasc. I (1995) 179-193.
-
(1995)
Le Matematiche L-Fasc.
, vol.1
, pp. 179-193
-
-
Milazzo, L.1
-
22
-
-
0012130410
-
The monochromatic block number
-
L. Milazzo, The monochromatic block number, Discrete Math. 165-166 (1997) 487-196.
-
(1997)
Discrete Math.
, vol.165
, Issue.166
, pp. 487-1196
-
-
Milazzo, L.1
-
23
-
-
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.1
Tuza, Z.2
-
24
-
-
0001116526
-
Strict colorings for classes of Steiner triple systems
-
L. Milazzo, Zs. Tuza, Strict colorings for classes of Steiner triple systems, Discrete Math. 182 (1998) 233-243.
-
(1998)
Discrete Math.
, vol.182
, pp. 233-243
-
-
Milazzo, L.1
Tuza, Z.2
-
26
-
-
33750692907
-
A characterization of uniquely colorable mixed hypergraphs of order n with upper chromatic numbers n -I and n -2
-
A. Niculitsa, H.-J. Voss, A characterization of uniquely colorable mixed hypergraphs of order n with upper chromatic numbers n -I and n -2. Austral. J. Combin. 21 (2000) 167-177.
-
(2000)
Austral. J. Combin.
, vol.21
, pp. 167-177
-
-
Niculitsa, A.1
Voss, H.-J.2
-
27
-
-
33750685491
-
The upper chromatic number of quasi-interval co-hypergraphs
-
V. Prisakaru, The upper chromatic number of quasi-interval co-hypergraphs, Le Matematiche LII-Fasc. II (1997) 237-260.
-
(1997)
Le Matematiche LII-Fasc.
, vol.2
, pp. 237-260
-
-
Prisakaru, V.1
-
28
-
-
0001043224
-
Graph colorings with local constraints-a survey
-
Zs. Tuza, Graph colorings with local constraints-a survey, Discuss. Math. Graph Theory 17 (2) (1997) 161-228.
-
(1997)
Discuss. Math. Graph Theory
, vol.17
, Issue.2
, pp. 161-228
-
-
Tuza, Z.1
-
30
-
-
0042677394
-
-
Kishinev, Stiinta, in Russian
-
V. Voloshin. Properties of triangulated graphs, Issledovanie operatsii i programmirovanie, Kishinev, Stiinta, 1982, pp. 24-32 (in Russian).
-
(1982)
Properties of Triangulated Graphs, Issledovanie Operatsii I Programmirovanie
, pp. 24-32
-
-
Voloshin, V.1
-
32
-
-
0001821089
-
On the upper chromatic number of a hypergraph
-
V. Voloshin, On the upper chromatic number of a hypergraph, Austral. J. Combin. 11 (1995) 25-45.
-
(1995)
Austral. J. Combin.
, vol.11
, pp. 25-45
-
-
Voloshin, V.1
-
34
-
-
33750724960
-
Circular mixed hypergraphs I: Colorability and unique colorability
-
V. Voloshin, H.-J. Voss, Circular mixed hypergraphs I: colorability and unique colorability, Congr. Numer. 144 (2000) 207-219.
-
(2000)
Congr. Numer.
, vol.144
, pp. 207-219
-
-
Voloshin, V.1
Voss, H.-J.2
-
35
-
-
0041705526
-
Pseudo-chordal mixed hypergraphs
-
V. Voloshin, H. Zhou, Pseudo-chordal mixed hypergraphs, Discrete Math. 202 (1999) 239-248.
-
(1999)
Discrete Math.
, vol.202
, pp. 239-248
-
-
Voloshin, V.1
Zhou, H.2
-
36
-
-
0039507624
-
-
DCS Associates, Moscow, Idaho, USA
-
A. Zykov, Fundamentals of Graph Theory, DCS Associates, Moscow, Idaho, USA, 1990.
-
(1990)
Fundamentals of Graph Theory
-
-
Zykov, A.1
|