On small uniquely vertex-colourable graphs and Xu's conjecture

Discrete Mathematics

Volumn 223, Issue 1-3, 2000, Pages 93-108

  Daneshgar, Amir ^a   Naserasr, Reza ^b  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

^b INSTITUTE FOR STUDIES IN THEORETICAL PHYSICS AND MATHEMATICS IPM   (Iran)

Author keywords

Graph colouring; Uniquely vertex colourable graphs; Xu's conjecture

Indexed keywords

EID: 0242289911     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00042-X     Document Type: Article

References (25)

1. B. Bollobás, Extremal Graph Theory, Academic Press, New York, 1978.
2. J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, American Elsevier Publishing Co. Inc., New York, 1976.
3. J.P. Boyd, K.N. Wexler, Trees with structure, J. Math. Psychol. 10 (1973) 115-147.
4. D. Cartwright, F. Harary, On the coloring of signed graphs, Elem. Math. 23 (1968) 85-89.
5. C.Y. Chao, Z. Chen, On uniquely 3-colorable graphs, Discrete Math. 112 (1993) 21-27.
6. C.Y. Chao, N.Z. Li, S.J. Xu, On q-trees, J. Graph Theory 10 (1986) 129-136.
7. G. Chartrand, D.P. Geller, On uniquely colorable planar graphs, J. Combin. Theory 6 (1969) 271-278.
8. A. Daneshgar, Forcing structures and cliques in uniquely vertex colorable graphs, SIAM J. Discrete Math., submitted for publication.
9. A. Daneshgar, Forcing structures and cliques in uniquely vertex colorable graphs, Technical Report 97-209, Institute for Studies in Theoretical Physics and Mathematics (IPM), Tehran, Iran, 1997.
10. A. Daneshgar, Forcing structures and uniquely colorable graphs, Proceedings of the 28th Iranian Mathematics Conference, no. 377 in Tabriz University Series, Tabriz, Iran, 1997, pp. 121-128.
11. A. Daneshgar, Forcing and graph colourings, Technical Report 98-292, Institute for Studies in Theoretical Physics and Mathematics (IPM), Tehran, Iran, 1998.
12. A. Daneshgar, On r-type constructions and Δ-colour-critical graphs, JCMCC 29 (1999) 183-206.
13. A. Daneshgar, A.J.W. Hilton, P.D. Johnson, Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphs, Discrete Math., submitted for publication.
14. A. Daneshgar, R. Naserasr, On some parameters related to uniquely vertex-colourable graphs and defining sets, submitted for publication.
15. M. Hall, Combinatorial Theory, 2nd Edition, Wiley, New York, 1986.
16. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.
17. F. Harary, S.T. Hedetniemi, R.W. Robinson, Uniquely colorable graphs, J. Combin. Theory 6 (1969) 264-270.
18. M. Mahdian, E.S. Mahmoodian, A characterization of uniquely 2-list colorable graphs, Ars Combin. to appear.
19. E.S. Mahmoodian, R. Naserasr, M. Zaker, Defining sets in vertex colorings of graphs and latin rectangles, Discrete Math. 167/168 (1997) 451-460.
20. R.C. Read, An introduction to chromatic polynomials, J. Combin. Theory 4 (1968) 52-71.
21. X. Shaoji, The size of uniquely colorable graphs, J. Combin. Theory (B) 50 (1990) 319-320 (note).
22. Z. Skupień, Stirling numbers and colouring of q-trees, Prace Nauk. Inst. Mat. Politechn. Wroclaw, 17 Ser. Stud. Materialy, No. 13, 1977, pp. 63-67.
23. M. Truszczyński, Some results on uniquely colorable graphs, Finite and Infinite Sets, Colloquia Mathematica Societatis Janos Bolyai, No. 37, Eger (Hungary), 1981, pp. 733-748.
24. D.B. West, Introduction to Graph Theory, Prentice-Hall, Upper Saddle River, NJ, 1996.
25. E.G. Whitehead Jr., Chromaticity of 2-trees, J. Graph Theory 9 (1985) 279-284.