-
1
-
-
0002586807
-
Galois theory for Post algebras I-II (Russian)
-
V.G. Bodnarčuk, L.A. Kaluzhnin, V.N. Kotov, B.A. Romov, Galois theory for Post algebras I-II (Russian), Kibernetika 3 (1969) 1-10;
-
(1969)
Kibernetika
, vol.3
, pp. 1-10
-
-
Bodnarčuk, V.G.1
Kaluzhnin, L.A.2
Kotov, V.N.3
Romov, B.A.4
-
2
-
-
0002586807
-
Galois theory for Post algebras I-II (Russian)
-
(English version: Cybernetics (1969) 243-252 531-539)
-
V.G. Bodnarčuk, L.A. Kaluzhnin, V.N. Kotov, B.A. Romov, Galois theory for Post algebras I-II (Russian) 5 (1969) 1-9 (English version: Cybernetics (1969) 243-252, 531-539).
-
(1969)
, vol.5
, pp. 1-9
-
-
Bodnarčuk, V.G.1
Kaluzhnin, L.A.2
Kotov, V.N.3
Romov, B.A.4
-
3
-
-
0007032241
-
Uniquely colorable graphs with large girth
-
B. Bollobás, N. Sauer, Uniquely colorable graphs with large girth, Can. J. Math. 28 (1976) 1340-1344.
-
(1976)
Can. J. Math.
, vol.28
, pp. 1340-1344
-
-
Bollobás, B.1
Sauer, N.2
-
4
-
-
0001869610
-
Graph theory and probability
-
P. Erdös, Graph theory and probability, Can. J. Math. 11 (1959) 34-38.
-
(1959)
Can. J. Math.
, vol.11
, pp. 34-38
-
-
Erdös, P.1
-
7
-
-
0034355299
-
Hedetniemi's conjecture and the retracts of products of graphs
-
B. Larose, C. Tardif, Hedetniemi's conjecture and the retracts of products of graphs, Combinatorica 20 (2000) 531-544.
-
(2000)
Combinatorica
, vol.20
, pp. 531-544
-
-
Larose, B.1
Tardif, C.2
-
8
-
-
0347495004
-
Strongly rigid graphs and projectivity
-
B. Larose, C. Tardif, Strongly rigid graphs and projectivity, Mult.-Valued Log. 7 (2001) 339-362.
-
(2001)
Mult.-Valued Log.
, vol.7
, pp. 339-362
-
-
Larose, B.1
Tardif, C.2
-
9
-
-
4644353175
-
On colorable critical and uniquely colorable critical graphs
-
M. Hiedler (Ed.), Academia, Prague
-
V. Müller, On colorable critical and uniquely colorable critical graphs, in: M. Hiedler (Ed.), Recent Advances in Graph Theory, Academia, Prague, 1975.
-
(1975)
Recent Advances in Graph Theory
-
-
Müller, V.1
-
10
-
-
0348012547
-
On coloring of graphs without short cycles
-
Müller, On coloring of graphs without short cycles, Discrete Math. 26 (1979) 165-179.
-
(1979)
Discrete Math.
, vol.26
, pp. 165-179
-
-
Müller, A.1
-
11
-
-
0007034895
-
On uniquely colorable graphs without short cycles
-
J. Nešetřil, On uniquely colorable graphs without short cycles, Časopis Pèst. Mat. 98 (1973) 122-125.
-
(1973)
Časopis Pèst. Mat.
, vol.98
, pp. 122-125
-
-
Nešetřil, J.1
-
13
-
-
0035962216
-
Construction of sparse graphs with prescribed circular colorings
-
J. Nešetřil, X. Zhu, Construction of sparse graphs with prescribed circular colorings, Discrete Math. 235 (2001) 277-291.
-
(2001)
Discrete Math.
, vol.235
, pp. 277-291
-
-
Nešetřil, J.1
Zhu, X.2
-
14
-
-
0030500782
-
Uniquely H-colorable graphs with large girth
-
X. Zhu, Uniquely H-colorable graphs with large girth, J. Graph Theory 23 (1996) 33-41.
-
(1996)
J. Graph Theory
, vol.23
, pp. 33-41
-
-
Zhu, X.1
-
15
-
-
0041153899
-
Circular coloring and graph homomorphisms
-
X. Zhu, Circular coloring and graph homomorphisms, Bull. Austral. Math. Soc. 59 (1999) 83-97.
-
(1999)
Bull. Austral. Math. Soc.
, vol.59
, pp. 83-97
-
-
Zhu, X.1
-
16
-
-
0033484068
-
Construction of uniquely H-colorable graphs
-
X. Zhu, Construction of uniquely H-colorable graphs, J. Graph Theory 30 (1999) 1-6.
-
(1999)
J. Graph Theory
, vol.30
, pp. 1-6
-
-
Zhu, X.1
|