Geodesic
Complete and pseudocomplete colourings of a graph
Mathematica slovaca, Tome 26 (1976) no. 3, pp. 171-184
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C15 
@article{MASLO_1976_26_3_a1,
     author = {Bos\'ak, Juraj and Ne\v{s}et\v{r}il, Jaroslav},
     title = {Complete and pseudocomplete colourings of a graph},
     journal = {Mathematica slovaca},
     pages = {171--184},
     year = {1976},
     volume = {26},
     number = {3},
     mrnumber = {0439672},
     zbl = {0373.05033},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1976_26_3_a1/}
}
TY  - JOUR
AU  - Bosák, Juraj
AU  - Nešetřil, Jaroslav
TI  - Complete and pseudocomplete colourings of a graph
JO  - Mathematica slovaca
PY  - 1976
SP  - 171
EP  - 184
VL  - 26
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/MASLO_1976_26_3_a1/
LA  - en
ID  - MASLO_1976_26_3_a1
ER  - 
%0 Journal Article
%A Bosák, Juraj
%A Nešetřil, Jaroslav
%T Complete and pseudocomplete colourings of a graph
%J Mathematica slovaca
%D 1976
%P 171-184
%V 26
%N 3
%U http://geodesic.mathdoc.fr/item/MASLO_1976_26_3_a1/
%G en
%F MASLO_1976_26_3_a1
Bosák, Juraj; Nešetřil, Jaroslav. Complete and pseudocomplete colourings of a graph. Mathematica slovaca, Tome 26 (1976) no. 3, pp. 171-184. http://geodesic.mathdoc.fr/item/MASLO_1976_26_3_a1/

[1] ACHARYA B. D.: Packing paгtitions and the packing numbeг of a gгaph. to appeaг.

[2] BEHZAD M.: The total chromatic number of a gгaph: a survey, In: Combinatorial Mathematics and its Applications. Academic Press, London 1971, 1-8. | MR

[3] BERGE, C: Graphes et hypergгaphes. Dunod, Paris 1970. | MR

[4] BOGUSZAK M., POLJAK S., TŮMA J.: A note on homomorpnism interpolation theoгems. to appeaг.

[5] BORIES F., JOLIVET J.-L.: On complete colourings of graphs. In: Recent Advances in Graph Theoгy, Pгoc. Symp. Prague, 1974. Academia, Prague 1975, 75-87. | MR

[6] BOSÁK J.: Chromatic index of finite and infinite graphs. Czechoslovak Math. J. 22, 1972, 272-290. | MR | Zbl

[7] COCKAYNE E. J., MILLER G. G., PRINS G.: An inteгpolation theorem foг paгtitions which are complete with respect to hereditary properties. J. Combinatorial Theory Sect. B 13, 1972, 290-297. | MR

[8] GELLER D., KRONK H.: Further results on the achromatic number. Fund. Math. 85, 1974, No. 3, 285-290. | MR | Zbl

[9] GUPTA R. P.: Bounds on the chromatic and achromatic numbers of complementary graphs. In: Recent Progress in Combinatorics, Proc. Third Waterloo Conf. on Combinatorics, 1968. Academic Press, New York 1969, 229-235. | MR

[10] HARARY F.: Graph theory. Addison-Wesley, Reading, Massachusets 1969. | MR | Zbl

[11] HARARY F., HEDETNIEMI S.: The achromatic number of a graph. J. Combinatorial Theory 8, 1970, 154-161. | MR | Zbl

[12] HARARY, R, HEDETNIEMI S., PRINS G.: An interpolation theorem for graphical homomorphisms. Port. Math. 26, 1967, 453-462. | MR | Zbl

[13] ORE O.: The four-color problem. Academic Press, New York 1967. | MR | Zbl

[14] SHANNON C. E.: A theorem on coloring the lines of a network. J. Math, and Phys. 28, 1949, 148-151. | MR | Zbl

[15] TAYLOR W.: Combinatory interpolation theorem, to appear.

[16] ВИЗИНГ В. Г.: Хроматический класс мультиграфа. Кибернетика 1965, N° 3, 29-39. | Zbl

[17] ЗЫКОВ А. А.: Теория конечных граов. Hayкa, Новосибиpck 1969. | Zbl