Complete and pseudocomplete colourings of a graph

Juraj Bosák; Jaroslav Nešetřil

Mathematica Slovaca (1976)

  • Volume: 26, Issue: 3, page 171-184
  • ISSN: 0232-0525

How to cite

top

Bosák, Juraj, and Nešetřil, Jaroslav. "Complete and pseudocomplete colourings of a graph." Mathematica Slovaca 26.3 (1976): 171-184. <http://eudml.org/doc/31999>.

@article{Bosák1976,
author = {Bosák, Juraj, Nešetřil, Jaroslav},
journal = {Mathematica Slovaca},
language = {eng},
number = {3},
pages = {171-184},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {Complete and pseudocomplete colourings of a graph},
url = {http://eudml.org/doc/31999},
volume = {26},
year = {1976},
}

TY - JOUR
AU - Bosák, Juraj
AU - Nešetřil, Jaroslav
TI - Complete and pseudocomplete colourings of a graph
JO - Mathematica Slovaca
PY - 1976
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 26
IS - 3
SP - 171
EP - 184
LA - eng
UR - http://eudml.org/doc/31999
ER -

References

top
  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. (1971) MR0277430
  3. BERGE, C, Graphes et hypergгaphes, Dunod, Paris 1970. (1970) MR0357173
  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. (1974) MR0384589
  6. BOSÁK J., Chromatic index of finite and infinite graphs, Czechoslovak Math. J. 22, 1972, 272-290. (1972) Zbl0239.05113MR0309777
  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. (1972) MR0309743
  8. GELLER D., KRONK H., Further results on the achromatic number, Fund. Math. 85, 1974, No. 3, 285-290. (1974) Zbl0287.05119MR0357198
  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. (1968) MR0256930
  10. HARARY F., Graph theory, Addison-Wesley, Reading, Massachusets 1969. (1969) Zbl0196.27202MR0256911
  11. HARARY F., HEDETNIEMI S., The achromatic number of a graph, J. Combinatorial Theory 8, 1970, 154-161. (1970) Zbl0195.25702MR0253930
  12. HARARY, R, HEDETNIEMI S., PRINS G., An interpolation theorem for graphical homomorphisms, Port. Math. 26, 1967, 453-462. (1967) Zbl0187.20903MR0272662
  13. ORE O., The four-color problem, Academic Press, New York 1967. (1967) Zbl0149.21101MR0216979
  14. SHANNON C. E., A theorem on coloring the lines of a network, J. Math, and Phys. 28, 1949, 148-151. (1949) Zbl0032.43203MR0030203
  15. TAYLOR W., [unknown], Combinatory interpolation theorem, to appear. 
  16. ВИЗИНГ В. Г., Хроматический класс мультиграфа, Кибернетика 1965, N° 3, 29-39. (1965) Zbl1099.01519
  17. ЗЫКОВ А. А., Теория конечных граов, Hayкa, Новосибиpck 1969. (1969) Zbl1149.62317

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.