-
1
-
-
84968512405
-
Extended arithmetic
-
G. Birkhoff, Extended arithmetic, Duke Math. J. 3 (1937) 311-316.
-
(1937)
Duke Math. J.
, vol.3
, pp. 311-316
-
-
Birkhoff, G.1
-
2
-
-
84972545539
-
Generalized arithmetic
-
G. Birkhoff, Generalized arithmetic, Duke Math. J. 9 (1942) 283-302.
-
(1942)
Duke Math. J.
, vol.9
, pp. 283-302
-
-
Birkhoff, G.1
-
3
-
-
84986529370
-
On the chromatic number of the product of graphs
-
D. Duffus, B. Sands and R. Woodrow, On the chromatic number of the product of graphs. J. Graph Theory 9 (1985) 487-495.
-
(1985)
J. Graph Theory
, vol.9
, pp. 487-495
-
-
Duffus, D.1
Sands, B.2
Woodrow, R.3
-
4
-
-
51249171151
-
The chromatic number of the product of two 4-chromatic graphs is 4
-
M.H. El-Zahar and N.W. Sauer, The chromatic number of the product of two 4-chromatic graphs is 4, Combinatorica 5 (1985) 121-126.
-
(1985)
Combinatorica
, vol.5
, pp. 121-126
-
-
El-Zahar, M.H.1
Sauer, N.W.2
-
5
-
-
0004190634
-
-
W.H. Freeman and Company, San Francisco
-
G. Grätzer, Lattice Theory (W.H. Freeman and Company, San Francisco, 1971).
-
(1971)
Lattice Theory
-
-
Grätzer, G.1
-
6
-
-
0001954953
-
On multiplicative graphs and the product conjecture
-
R. Haggkvist, P. Hell, D.J. Miller and V.N. Lara, On multiplicative graphs and the product conjecture, Combinatrica 8 (1988) 63-74.
-
(1988)
Combinatrica
, vol.8
, pp. 63-74
-
-
Haggkvist, R.1
Hell, P.2
Miller, D.J.3
Lara, V.N.4
-
7
-
-
51249173222
-
1-chromatic graphs can be countable
-
1-chromatic graphs can be countable, Combinatorica 5 (1985) 137-140.
-
(1985)
Combinatorica
, vol.5
, pp. 137-140
-
-
Hajnal, A.1
-
12
-
-
0009788311
-
The categorical product of graphs
-
D.J. Miller, The categorical product of graphs, Can. J. Math. 20 (1968) 1511-1521.
-
(1968)
Can. J. Math.
, vol.20
, pp. 1511-1521
-
-
Miller, D.J.1
-
13
-
-
84968518350
-
Co-limits in topoi
-
R. Paré, Co-limits in topoi, Bull. Am. Math. Soc. 80 (1974) 556-561.
-
(1974)
Bull. Am. Math. Soc.
, vol.80
, pp. 556-561
-
-
Paré, R.1
-
14
-
-
0010113806
-
On the arc-chromatic number of a digraph
-
S. Poljak and V. Rödl, On the arc-chromatic number of a digraph. JCT B 31 (1981) 190-198.
-
(1981)
JCT B
, vol.31
, pp. 190-198
-
-
Poljak, S.1
Rödl, V.2
-
15
-
-
0041513365
-
Coloring digraphs by iterated antichains
-
S. Poljak, Coloring digraphs by iterated antichains. Comment. Math. Univ. Carolinae 32 (1991) 209-212.
-
(1991)
Comment. Math. Univ. Carolinae
, vol.32
, pp. 209-212
-
-
Poljak, S.1
-
18
-
-
0000692175
-
Graph multiplication
-
G. Sabidussi, Graph multiplication, Math. Z. 72 (1960) 446-457.
-
(1960)
Math. Z.
, vol.72
, pp. 446-457
-
-
Sabidussi, G.1
-
19
-
-
85030000235
-
Multiplicative posets
-
to appear
-
N.W. Sauer and X. Zhu, Multiplicative Posets, ORDER, to appear.
-
ORDER
-
-
Sauer, N.W.1
Zhu, X.2
-
20
-
-
84987524980
-
An approach to Hedetniemi's conjecture
-
to appear
-
N.W. Sauer and X. Zhu, An approach to Hedetniemi's conjecture, J. Graph Theory, to appear.
-
J. Graph Theory
-
-
Sauer, N.W.1
Zhu, X.2
-
21
-
-
0002723901
-
Color-families are dense
-
E. Welzl, Color-families are dense, Theoret. Comput. Sci. 17 (1982) 29-41.
-
(1982)
Theoret. Comput. Sci.
, vol.17
, pp. 29-41
-
-
Welzl, E.1
|