Result 261 to 276 of 276 total
How colorful the signed graph? (English)
Discrete Math. 52, 279-284 (1984).
261
Minimal graphs for which the chromatic number equals the maximal degree. (English)
Ars Comb. 18, 201-216 (1984).
262
A new method of proving theorems on chromatic index. (English)
Discrete Math. 52, 159-164 (1984).
263
On a problem of G. Hahn about coloured Hamiltonian paths in $K\sb{2n}$. (English)
Discrete Math. 51, 213-214 (1984).
264
Representation of a tree with p terminal vertices by 2p-3 elements of its distance matrix. (Russian)
Mat. Zametki 35, No.6, 877-887 (1984).
265
The chromaticity of wheels. (English)
Discrete Math. 51, 207-212 (1984).
266
On the chromatic index of multigraphs without large triangles. (English)
J. Comb. Theory, Ser. B 36, 156-160 (1984).
267
A symmetric sum involving the Stirling numbers of the first kind. (English)
Eur. J. Comb. 5, 51-54 (1984).
268
New binary operations on graphs. (English)
Bull. Math. Soc. Sci. Math. Répub. Soc. Roum., Nouv. Sér. 28(76), 55-62 (1984).
269
Coloring island maps. (English)
Bull. Aust. Math. Soc. 29, 151-165 (1984).
270
On Turán’s problem for 3-graphs. (Russian)
Komb. Anal. 6, 51-57 (1983).
271
On the complexity of dynamic tests for Boolean functions. (Russian)
Dokl. Akad. Nauk Arm. SSR 77, 113-116 (1983).
272
On complete verifying tests for contact schemes. (Russian)
Metody Diskretn. Anal. 39, 80-87 (1983).
273
On the ochromatic number of a graph. (English)
Combinatorics, graph theory and computing, Proc. 14th Southeast. Conf., Boca Raton/Flo. 1983, Congr. Numerantium 40, 339-366 (1983).
274
On linear and semilinear pointsets in graphs. (English)
Bull. Math. Soc. Sci. Math. Répub. Soc. Roum., Nouv. Sér. 27(75), 343-351 (1983).
275
v-connected hypergraphs. (Romanian)
Bul. Ştiinţ. Teh. Inst. Politeh. Timişoara, Ser. Mat.-Fiz. 26(40), No.1, 41-43 (1981).
276
Result 261 to 276 of 276 total
Start
Contact
Print
General Help
