Result 101 to 120 of 276 total
Further enumerating Boolean functions of cryptographic significance. (English)
J. Cryptology 8, No.3, 115-122 (1995).
101
On diagonally 10-coloring plane triangulations. (English)
J. Graph Theory 20, No.1, 77-85 (1995).
102
A note on colouring of complete graphs. (English)
Q. J. Math., Oxf. II. Ser. 46, No.182, 235-237 (1995).
103
The diameter of a random graph with bounded diameter. (English)
Random Struct. Algorithms 6, No.2-3, 193-199 (1995).
104
Properties of chromatic polynomials of unlabeled graphs. (English)
J. Comb. Math. Comb. Comput. 17, 21-32 (1995).
105
A polynomial expansion of $k$-valued functions with respect to nondegenerate functions. (English)
Math. Notes 55, No.1, 96-100 (1994); translation from Mat. Zametki 55, No.1, 144-149 (1994).
106
Region coloring, edge coloring, and scan-conversion of maps. (English)
Int. J. Comput. Geom. Appl. 4, No.4, 423-455 (1994).
107
Digital metrics generated by families of paths. (English)
Discrete Math. 135, No.1-3, 265-277 (1994).
108
A note on the conditional chromatic polynomial. (English)
Glasg. Math. J. 36, No.3, 265-267 (1994).
109
Bilinear and trilinear partitions of a graph. (English)
Indian J. Pure Appl. Math. 25, No.8, 843-850 (1994).
110
Maximizing the number of unused colors in the vertex coloring problem. (English)
Inf. Process. Lett. 52, No.2, 87-90 (1994).
111
Hypergraphs and sharpened sieve inequalities. (English)
Discrete Math. 132, No.1-3, 75-82 (1994).
112
Near-perfect matrices. (English)
Math. Program. 64, No.3 (A), 295-323 (1994).
113
Maximal TC-clones, graphs and relations. (TC-clones maximaux, graphes et relations.) (French)
Discrete Math. 130, No.1-3, 77-82 (1994).
114
Bounds on certain multiplications of affine combinations. (English)
Discrete Appl. Math. 52, No.2, 155-167 (1994).
115
New upper bounds on harmonious colorings. (English)
J. Graph Theory 18, No.3, 257-267 (1994).
116
On the reconstructibility of basic invariants of a graph. (Russian)
Diskretn. Mat. 5, No.4, 109-119 (1993).
117
A polynomial decomposition of Boolean functions. (English)
Math. Notes 53, No.2, 130-133 (1993); translation from Mat. Zametki 53, No.2, 25-29 (1993).
118
A random recolouring method for graphs and hypergraphs. (English)
Comb. Probab. Comput. 2, No.3, 363-365 (1993).
119
A zero-free interval for chromatic polynomials of graphs. (English)
Comb. Probab. Comput. 2, No.3, 325-336 (1993).
120
Result 101 to 120 of 276 total
Start
Contact
Print
General Help
