On the existence of graphs with prescribed coloring parameters

Discrete Mathematics

Volumn 216, Issue 1-3, 2000, Pages 293-297

  Yegnanarayanan, V ^a,c   Balakrishnan, R ^b   Sampathkumar, R ^b  

^a VIT UNIVERSITY   (India)

^b ANNAMALAI UNIVERSITY   (India)

^c NONE   (India)

Author keywords

Achromatic number; Chromatic number; Pseudoachromatic number

Indexed keywords

EID: 0347999770     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00351-9     Document Type: Article

References (12)

1. V.N. Bhave, On the Pseudoachromatic number of a graph, Fund. Math. 102 (1979) 159-164.
2. J.A. Bondy, U.S.R. Murty, Graph Theory and its Applications, Macmillan, London, 1976.
3. B. Descartes, Solution to advanced Problem No. 4526, Amer. Math. Monthly 61 (1952) 352.
4. G.A. Dirac, Graph Union and Chromatic number, J. London Math. Soc. 39 (1964) 451-454.
5. P. Erdos, Graph Thory and Probability II, Canad. J. Math. 13 (1961) 346-352.
6. R.P. Gupta, Bounds on the chromatic and achromatic numbers of complementary graphs, Recent Progress in Combinatorics, Proceedings of Third Waterloo Conference on combinatorics, Waterloo, 1968, Academic Press, New York, 1969, pp. 229-235.
7. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.
8. F. Harary, S. Hedetniemi, The achromatic number of a graph, J. Combin. Theory 8 (1970) 154-161.
9. J.B. Kelley, L.M. Kelley, Paths and circuits in critical graphs, Amer. J. Math. 76 (1954) 786-792.
10. L. Lovasz, On Chromatic number of finite systems, Acta. Math. Acad. Sci. Hungar. 19 (1968) 59-67.
11. J. Mycielski, Sur le coloriage des graphes, Colloq. Math. 3 (1955) 161-162.
12. A.A. Zykov, On some properties of linear complexes, Mat. Sbornik 24 (1949) 163-168 (in Russian), Amer. Math. Soc. Translation No. 79, 1952.