Chromatic polynomials and chromaticity of graphs

Chromatic Polynomials and Chromaticity of Graphs

Volumn , Issue , 2005, Pages 1-357

  Dong, F M ^a   Koh, K M ^b   Teo, K L ^c  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c MASSEY UNIVERSITY   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84967638977     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1142/5814     Document Type: Book

References (402)

1. B. D. Acharya (1982), Connected graphs switching equivalent to their iterated line graphs, Discrete Math. 41, 115-122.
2. A. A. Adam and I. Broere (1993), Chromatic polynomials of graphs in terms of chromatic polynomials of trees, J. Math. Phys. Sci. 27, no. 3, 231-240.
3. D. Avis, C. De Simone and P. Nobili (2000), Two conjectures on the chromatic polynomials, Lecture Notes, Comput Sci. 1776: 154-162.
4. D. Avis, C. De Simone and P. Nobili (2002), On the chromatic polynomial of a graph. ISMP 2000, Part 2 (Atlanta, GA), Math. Program. 92, no. 3, Ser. B, 439-452.
5. X.W. Bao and X.E. Chen (1994), Chromaticity of the graph θ(a, 6, c, d. e) (Chinese, English and Chinese summaries), J. Xinjiang Univ. Natur. Sci. 11, 19-22.
6. R.A. Bari (1974), Chromatically equivalent graphs, Graphs and combinatorics (Proc. Capital Conf., George Washington Univ., Washington, D.C., 1973), pp. 186-200. Lecture Notes in Math, Vol. 406, Springer, Berlin.
7. R.A. Baxi and D.W. Hall (1977), Chromatic polynomials and Whitney’s broken circuits, J. Graph Theory 1, no. 3, 269-275.
8. S. Barnard and J.F. Child, Higher Algebra, Macmillan, London, 1955.
9. S. Barnett (1983), Polynomials and linear control systems, Monographs and Textbooks in Pure and Applied Mathematics, 77. Marcel Dekker, Inc., New York.
10. J.E. Bartels, and D.J.A. Welsh (1995), The Markov chain of colourings, In “Proceedings of the Fourth Conference on Integer Programming and Combinatorial Optimization (IPCO IV)”, Lecture Notes in Computer Science, Vol. 920, pp. 373-387, Springer-Verlag, New York/Berlin, 1995.
11. L.W. Beineke (1971), Derived graphs with derived complements, Recent Trends in Graph Theory (Proc. Conf., New York, 1970), 15-24, Lecture Notes in Mathematics, Vol. 186, Springer, Berlin.
12. S. Beraha (1975), Infinite non-triυial families of maps and chromials, Ph.D. thesis, Johns Hopkins University, 1975.
13. S. Beraha and J. Kahane (1979), Is the four-color conjecture almost false? J. Combin. Theory Ser. B 28, no. 1, 1-12.
14. 7 and Bio are limit points of chromatic zeros, Notices Amer. Math. Soc. 20, 45.
15. S. Beraha, J. Kahane and N.J. Weiss (1975), Limits of zeroes of recursively defined polynomials, Proc. Nat. Acad. Sci. U.S.A. 72, no. 11, 4209.
16. S. Beraha, J. Kahane and N.J. Weiss (1978), Limits of zeros of recursively defined families of polynomials, Studies in foundations and combinatorics pp. 213-232, Adv. in Math. Suppl. Stud., 1, Academic Press, New York-London.
17. S. Beraha, J. Kahane and N.J. Weiss (1980), Limits of chromatic zeros of some families of maps, J. Combin. Theory Ser. B 28, no. 1, 52-65.
18. H. Bielak (1997), Chromatic uniqueness in a family of 2-connected graphs, Discrete Math. 164, 21-28.
19. H. Bielak (2001), Roots of chromatic polynomials, Discrete Math. 231, 97-102.
20. H. Bielak, Chromatic coefficients, Preprint.
21. N.L. Biggs (2002), Chromatic polynomials for twisted bracelets, Bull. London Math. Soc. 34, no. 2, 129-139.
22. N.L. Biggs, R.M. Damerell, and D.A. Sands (1972), Recursive families of graphs, J. Combin. Theory Ser. B 12, 123-131.
23. N.L. Biggs, M.H. Klin and P. Reinfeld (2002), Algebraic methods for chromatic polynomials, Preprint.
24. N.L. Biggs, G. H. J. Meredith 1976, Approximations for chromatic polynomials. J. Combin. Theory Ser. B 20, 5-19.
25. G. D. Birkhofï (1912), A determinant formula for the number of ways of coloring a map, Annal. Math. 14, no. 2, 42-46.
26. G. D. Birkhoff and D.C. Lewis (1946), Chromatic polynomials, Trans. Amer. Math. Soc. 60, 355-351.
27. J.A. Bondy and U.S.R. Murty (1976), Graph theory with applications, American Elsevier Publishing Co., Inc., New York.
28. O.V. Borodin and I.G. Dmitriev (1991), Characterization of chromatically rigid polynomials. (Russian) Sibirsk. Mat. Zh. 32, no. 1, 22-27, 219; translation in Siberian Math. J. 32, no. 1, 17-21.
29. M. Borowiecki and E. Drgas-Burchardt (1993a), Classes of chromatically unique graphs, Discrete Math. 111, 71-75.
30. M. Borowiecki and E. Drgas-Burchardt (1993b), Classes of chromatically unique or equivalent graphs, Discrete Math. 121, 11-18.
31. P. Borwein (2002), Computational Excursions in Analysis and Number Theory, CMS Books in Mathematics, Springer-Verlag New York, Inc.
32. K. Braun, M. Kretz, B. Walter and M. Walter (1974), Die chromatischen polynome unterringfreier graphen, Manuscripa Math. 14, 223-234.
33. F. Brenti (1992), Expansion of chromatic polynomials and log-concavity, Trans. Amer. Math. Soc. 332, 729-755.
34. F. Brenti, G.F. Royle and D.G. Wagner (1994), Location of zeros of chromatic and related polynomials of graphs, Canad. J. Math. 46, no. 1, 55-80.
35. J. I. Brown (1998a), Chromatic polynomials and order ideals of monomials, Discrete Math. 189, 43-68.
36. J. I. Brown (1998b), On the roots of chromatic polynomials, J. Combin. Theory Ser. B 72, 251-256.
37. J.I. Brown (1999), Subdivisions and chromatic roots. J. Combin. Theory Ser. B 76, 201-204.
38. J.I. Brown and C.A. Hickman (2002a), On chromatic roots with negative real part. Ars Combin. 63, 211-221.
39. J.I. Brown and C.A. Hickman (2002b), On chromatic roots of large subdivisions of graphs. Discrete Math. 242, 17-30.
40. J. I. Brown, C. Hickman, A. D. Sokal and D.G. Wagner (2001), On the chromatic roots of generalized Theta graphs, J. Combin. Theory Ser. B 83, 272-297.
41. T.H. Brylawski and J.G. Oxley (1992), The Tutte polynomial and its applications, Matroid Applications, N. White ed., Cambridge Univ. Press, pp. 123-225.
42. L. Caccetta and S. Foldes (1997), Symmetric calculation of chromatic polynomials, Ars Combin. 4, 289-292.
43. S.C. Chang (2001), Chromatic polynomials for lattice strips with cyclic boundary conditions, Phys. A 296, no. 3-4, 495-522.
44. C.Y. Chao, Z.Y. Guo and N.Z. Li (1992), Some families of chromatically equivalent graphs, Bull. Malaysian Math. Soc. (2) 15, no. 2, 77-82.
45. C.Y. Chao, Z.Y. Guo and N.Z. Li (1997), On q-graphs, Discrete Math. 172, 9-16.
46. C.Y. Chao and N.Z. Li (1985), On trees of polygons, Arch. Math. 45, 180-185.
47. C.Y. Chao, N.Z. Li and S.J. Xu (1986), On q-trees, J. Graph Theory 10, no. 1, 129-136.
48. C.Y. Chao and G. A. Novacky Jr. (1982), On maximally saturated graphs, Discrete Math. 41, no. 2, 139-143.
49. C.Y. Chao and E.G. Whitehead Jr. (1978), On chromatic equivalence of graphs, Theory and applications of graphs (Proc. Intemat. Conf, Western Mich. Univ., Kalamazoo, Mich., 1976), pp. 121-131. Lecture Notes in Math., Vol. 642, Springer, Berlin.
50. C. Y. Chao and E.G. Whitehead Jr. (1979a), Chromaticity of self-complementary graphs. Arch. Math. (Basel) 32, no. 3, 295-304.
51. C. Y. Chao and E.G. Whitehead Jr. (1979b), Chromatically unique graphs, Discrete Math. 27, no. 2, 171-177.
52. C. Y. Chao and L.C. Zhao (1983), Chromatic polynomials of a family of graphs, Ars Combin. 15, 111-129.
53. 5- homeomorphs, Preprint.
54. X.B. Chen (1998), Some families of chromatically unique bipartite graphs, Discrete Math. 184, 245-253.
55. X.E. Chen and X.W. Bao (1994), Chromaticity of the graph θ(a, b, c, d, e) (Chinese), J. Xinjiang Univ. 11, no. 3, 19-22.
56. X.E. Chen, X.W. Bao and K.Z. Ouyang (1992), Chromaticity of the graph θ(a, b, c, d), J. Shaanxi Normal Univ. 20, 75-79.
57. X.E. Chen and K.Z. Ouyang (1992), Chromaticity of some 2-connected (n, n+2)- graphs, J. Lanzhou University (Natural Sciences) 28, 183-184.
58. 4, Discrete Math. 172, 17-22.
59. X.E. Chen and K.Z. Ouyang (1997b), Chromatic classes of certain 2-connected (n, n + 2)-graphs II, Discrete Math. 172, 31-38.
60. G. L. Chia (1986), A note on chromatic uniqueness of graphs, J. Graph Theory 10, 541-543.
61. G. L. Chia (1988a), Some remarks on the chromatic uniqueness of graphs, Ars Combin. 26A, 65-72.
62. G. L. Chia (1988b), The Petersen graph is uniquely determined by its chromatic polynomial, Research Report No. 31/88, Department of Mathematics, Univ. Malaya.
63. G. L. Chia (1990), The chromaticity of wheels with a missing spoke, Discrete Math. 82, 209-212.
64. G. L. Chia (1995a), On the join of graphs and chromatic uniqueness, J. Graph Theory 19, 251-261.
65. G. L. Chia (1995b), On chromatic uniqueness of graphs with connectivity two, Malaysian J. Science 16B, 61-65.
66. G. L. Chia (1996a), The chromaticity of wheels with a missing spoke, II, Discrete Math. 148, 305-310.
67. G. L. Chia (1996b), On the chromatic equivalence class of a family of graphs, Discrete Math. 162, 285-289.
68. G. L. Chia (1997a), Some problems on chromatic polynomials, Discrete Math. 172, 39-44.
69. G. L. Chia (1997b), A bibliography on chromatic polynomials, Discrete Math. 172, 175-191.
70. G. L. Chia (1998), On the chromatic equivalence class of graphs, Discrete Math. 178, 15-23.
71. G. L. Chia, B.H. Goh and K.M. Koh (1988), The chromaticity of some families of complete tripartite graphs, Scientia, Ser. 2, 27-37.
72. G. L. Chia and C.K. Ho (2001), On the chromatic uniqueness of edge-gluing of complete bipartite graphs and cycles, Ars Combin. 60, 193-199.
73. G. L. Chia and C.K. Ho (2003), On the chromatic uniqueness of edge-gluing of complete tripartite graphs and cycles, Bull. Malaysian Math. Sc. Soc. (Second Series) 26, 87-92.
74. G. L. Chia and C.K. Ho (2004), A result on chromatic uniqueness of edge-gluing of graphs, preprint.
75. G. L. Chia and C.K. Ho (2005), Chromatic equivalence classes of complete tripartite graphs, preprint.
76. V. Chvátal (1970), A note on coefficients of chromatic polynomials, J. Combin. Theory 9, 95-96.
77. L.Y. Cui, L.C. Zhao and X.J. Ma (2000), Adjoint uniqueness of three families of connected graphs, J. Northeastern Univ. (Natural. Sc.) 21, no. 4, 218-221.
78. O. M. Dántona, C. Mereghetti and F. Zamparini (2001), The 224 non-chordal graphs on less than 10 vertices whose chromatic polynomials have no complex roots, Discrete Math. 226, 387-396.
79. M. Dhurandhar (1984), Characterization of quadratic and cubic σ- polynomials, J. Combin. Theory Ser. B 37, 210-220.
80. G. A. Dirac (1952), A property of 4-chromatic graphs and some results on critical graphs, J. London Math. Soc. 27, 85-92.
81. G. A. Dirac (1961), On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg 25, 71-76.
82. I. G. Dmitriev (1980), Weakly cyclic graphs with integral chromatic number, (in Russian), Metody Diskret. Analiz. 34, 3-7.
83. I. G. Dmitriev (1982), Characterization of a class of k-trees, (Russian) Metody Diskret. Analiz. No. 38, 9-18.
84. K. Dohmen (1993a), Chromatische Polynome von Graphen und Hypergraphen, Dissertation, Uniυersität Düsseldorf.
85. K. Dohmen (1993b), Lower bounds and upper bounds for chromatic polynomials. J. Graph Theory 17, no. 1, 75-80.
86. K. Dohmen (1996), On graph invariants satisfying the deletion-contraction formula, J. Graph Theory 21, no. 3, 311-316.
87. K. Dohmen (1998), Bounds to the chromatic polynomial of a graph, Results Math. 33, no. 1-2, 87-88.
88. K. Dohmen (1999), On partial sums of chromatic polynomials. Ars Combin. 52, 125-127.
89. K. Dohmen, A. Pönitz and P. Tittmann (2002), A new two-variable generalization of the chromatic polynomial, Preprint.
90. F.M. Dong (1990), Uniqueness of the chromatic polynomial of a generalized wheel graph (Chinese), J. Math. Res. Exposition 10, no. 3, 447-454.
91. F.M. Dong (1993), On chromatic uniqueness of two infinite families of graphs, J. Graph Theory 17, 387-392.
92. F.M. Dong (1997), Structures and chromaticity of graphs, Ph. D. Thesis, Dept, of Math., National University of Singapore.
93. F.M. Dong (2000), Proof of a chromatic polynomial conjecture, J. Combin. Theory Ser. B 78, no. 1, 35-44.
94. F.M. Dong (2003), Bounds for mean colour numbers of graphs, J. Combin. Theory Ser. B 87, 348-365.
95. F.M. Dong (2004), The largest non-integer zero of chromatic polynomials of graphs with fixed order, Discrete Math. 282, 103-112.
96. F.M. Dong and K.M. Koh (1997a), On graphs in which any pair of colour classes but one induces a tree, Discrete Math. 169, 39-54.
97. F.M. Dong and K.M. Koh (1997b), On the structure and chromaticity of graphs in which any two colour classes induce a tree, Discrete Math. 176, 97-113.
98. F.M. Dong and K.M. Koh (1998), Non-chordal graphs having integral-root chromatic polynomials, Bull. Combin. Appl. 22, 67-77.
99. F.M. Dong and K.M. Koh (1999a), Structures and chromaticity of some extremal 3- colourable graphs, Discrete Math. 203, 71-82.
100. F.M. Dong and K.M. Koh (1999b), The acyclic colouring, triangle number and chromatic polynomial of a graph, Algebras and combinatorics (Hong Kong, 1997), 217-236, Springer, Singapore.
101. F.M. Dong and K.M. Koh (2004a), On upper bounds for real roots of chromatic polynomials, Discrete Math. 282, 95-101.
102. F.M. Dong and K.M. Koh (2004b), Two results on real zeros of chromatic polynomials, Combin. Probab. Comput. 13, 809-813.
103. F.M. Dong and K.M. Koh (2004c), A note on a zero-free interval for chromatic polynomials of bipartite graphs, preprint.
104. F.M. Dong and K.M. Koh (2004d), Domination numbers and zeros of chromatic polynomials, preprint.
105. F.M. Dong and K.M. Koh (2005a), On plane graphs whose chromatic polynomials are zero-free in (1,2), preprint.
106. F.M. Dong, K.M. Koh and C.A. Soh (2004), Divisibility of certain coefficients of the chromatic polynomials, Discrete Math. 275, 311-317.
107. F.M. Dong, K.M. Koh and K.L. Teo (2001), Structures and chromaticity of extremal 3-colourable sparse graphs, Graphs and Combin. 17, no. 4, 611-635.
108. F.M. Dong, K.M. Koh, K.L. Teo, C.H.C. Little and M.D. Hendy (2000a), An attempt to classify bipartite graphs by chromatic polynomials, Discrete Math. 222, 73-88.
109. F.M. Dong, K.M. Koh, K.L. Teo, C.H.C. Little and M.D. Hendy (2000b), Chromatically unique bipartite graphs with low 3-independent partition numbers, Discrete Math. 224, 107-124.
110. F.M. Dong, K.M. Koh, K.L. Teo, C.H.C. Little and M.D. Hendy (2001), Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs, J. Graph Theory 37, no. 1, 48-77.
111. F.M. Dong and Y.P. Liu (1996), On the chromatic uniqueness of the graph W(n, n - 2, k), Graphs and Combin. 12,'no. 3, 221-230.
112. F.M. Dong and Y.P. Liu (1998), All wheels with two missing consecutive spokes are chromatically unique, Discrete Math. 184, 71-85.
113. F.M. Dong, Y.P. Liu and K.M. Koh (1997), The chromaticity of odd wheels with a missing spoke, New Zealand J. Math. 26, no. 1, 31-44.
114. F.M. Dong, K.L. Teo and K.M. Koh (2002), A note on the chromaticity of some 2-connected (n, n + 3)-graphs, Discrete Math. 243, 217-221.
115. F.M. Dong, K.L. Teo, K.M. Koh and M.D. Hendy (2002), Non-chordal graphs having integral-root chromatic polynomials II, Discrete Math. 245, 247-253.
116. F.M. Dong, K.L. Teo, C.H.C. Little and M.D. Hendy (2001), Some inequalities on chromatic polynomials, New Zealand J. Math. 30, no. 2, 111-118.
117. F.M. Dong, K.L. Teo, C.H.C. Little and M.D. Hendy (2002a), Two invariants for adjointly equivalent graphs. Australas. J. of Combin. 25, 133-143.
118. F.M. Dong, K.L. Teo, C.H.C. Little and M.D. Hendy (2002b), Zeros of adjoint polynomials of paths and cycles. Australas. J. Combin. 25, 167-174.
119. F. M. Dong, K.L. Teo, C.H.C. Little and M.D. Hendy (2002c), Chromaticity of some families of dense graphs, Discrete Math. 258, 3030-321.
120. F. M. Dong, K.L. Teo, C.H.C. Little, M.D. Hendy and K.M. Koh (2004), Chromatically unique multibridge graphs, Electronic J. of Combin. Theory 11, #R12.
121. Q.Y. Du (1992), Chromatic polynomials of triangulated graphs (Chinese, English summary), Nei Mongol Daxue Xuebao Ziran Kexue 23, 148-151.
122. Q.Y. Du (1993a), On σ-polynomials and a class of chromatically unique graphs, Discrete Math. 115, 153-165.
123. Q.Y. Du (1993b), A partial ordering of the σ-polynomials (Chinese, English and Chinese summaries), Neimenggu Daxue Xuebao Ziran Kexue 24, 563-566.
124. Q.Y. Du (1994), New upper bounds for the coefficients of σ-polynomials (Chinese, English and Chinese summaries), Neimenggu Daxue Xuebao Ziran Kexue 25, 14-16.
125. Q.Y. Du (1995), On the parameter π(G) of graph G and graph classification, Acta Sc. Naturalium, Univ. Neimonggol, 26, no. 3, 258-262.
126. Q.Y. Du (1996a), Chromaticity of the complements of paths and cycles, Discrete Math. 162, 109-125.
127. Q.Y. Du (1996b), On σ-equivalcnce and ^-equivalence of graphs, J. Graph Theory 21, 211-217.
128. Q.Y. Du (1996c), The σ-polynomials of unlabeled graphs (Chinese), Neimenggu Daxue Xuebao Ziran Kexue 27, no. 5, 601-605.
129. R.J. Duffin (1965), Topology of series-parallel networks, J. Math. Anal. Appl. 10, 303-318.
130. B. Eisenberg (1971), Generalized lower bounds for the absolute values of the coefficients of chromatic polynomials, Lecture Notes in Math. 186 (Springer), 85-94.
131. B. Eisenberg (1972), Characterization of a tree by means of coefficients of the chromatic polynomial, Trans. New York Acad. Sci. 34, 146-153.
132. m+1 and generalized trees (Chinese), J. Shanghai Teachers Univ. (Natural Sc.) 27, no. 3, 28-34.
133. r+2 (Chinese), J. Shanghai Teachers Univ. (Natural Sc.) 29, no. 2, 24-29.
134. Y. Fang, Y.B. Shi and M.Y. Tang (2002), Classes of chromatically equivalent graphs on the gluing of two wheels, Preprint.
135. G. E. Farr (1993), A correlation inequality involving stable set and chromatic polynomials, J. Comb. Theo., Series B 58, 14-21.
136. E.J. Farrell (1979), An introduction to matching polynomials, J. Comb. Theo., Series B 27, 75-86.
137. E.J. Farrell (1980a), Chromatic roots-some observations and conjectures, Discrete Math. 29, no. 2, 161-167.
138. E.J. Farrell (1980b), On chromatic coefficients, Discrete Math. 29, no. 3, 257-264.
139. E.J. Farrell (1993), The impact of F-polynomials in graph theory, Ann. Discrete Math. 55, 173-178.
140. E.J. Farrell (2000), On the derivative of the chromatic polynomial, Bull. Inst. Combin. Appl. 29, 33-38.
141. E. J. Farrell and E.G. Whitehead Jr. (1990), On matching and chromatic properties of circulants, J. Combin. Math. Combin. Comput. 8, 79-88.
142. E.J. Farrell and E.G. Whitehead Jr. (1991), Matching, rook and chromatic polynomials and chromatically vector equivalent graphs, J. Combin. Math. Combin. Comput. 9, 107-118.
143. E. J. Farrell and E.G. Whitehead Jr. (1992), Connections between the matching and chromatic polynomials, Intemat. J. Math. Math. Set. 15, no. 4, 757-766.
144. S. Frank and D. Shier (1986), The chromatic polynomial revisited, Proceedings of the seventeenth Southeastern international conference on combinatorics, graph theory, and computing (Boca Raton, Fla., 1986). Congr. Numer. 55, 57-68.
145. R.W. Frucht (1985), A new method of computing chromatic polynomials of graphs, Analysis, geometry, and probability (Valparaso, 1981), 69-77, Lecture Notes in Pure and Appl. Math., 96, Dekker, New York.
146. R.W. Frucht and R.E. Giudici (1983), Some chromatically unique graphs with seven points, Ars Combin. 16A, 161-172.
147. R.W. Frucht and R.E. Giudici (1985), A note on the matching numbers of triangle-free graphs, J. Graph Theory 9, 455-458.
148. D. Fulkerson and O. Gross (1965), Incidence matrices and interval graphs, Pacific J. Math. 15, 835-855.
149. F. R. Gantmacher (1960), Matrix Theory, vol. II, Chelsea, New York.
150. D. Gernert (1984), Recent results on chromatic polynomials, Contributions to operations research and mathematical economics, Vol. I, 307-314, Methods Oper. Res., 51, Athenum/Hain/Hanstein, Knigstein.
151. D. Gernert (1985), A survey of partial proofs for Read’s conjecture and some recent results, IX symposium on operations research. Part I. Sections 1-4 (Osnabrück, 1984), 233-238, Methods Oper. Res., 49, Athenäum/Hain/Hanstein, Königstein.
152. R.E. Giudici (1982), Formas recursivas para los polinomios cromaticos de los prismas y sus asociados, Report No. 76, Dpto. de Mat. y Ciencia de la Comp. Univ. Simon Bolivar.
153. R.E. Giudici (1985), Some new families of chromatically unique graphs, Analysis, Geometry, and Probability, Lecture Notes in Pure and Appl. Math. 96 Dekker, New York, 147-158.
154. R.E. Giudici (1988), A note on chromatic equivalence of graphs, Scientia, Valparaiso, Chile.
155. R.E. Giudici and Lima de Sá (1990), Chromatic uniqueness of certain bipartite graphs, Congr. Numer. 76, 69-75.
156. n, Report No. 85-03, Dpto. de Mat. y Ciencia de la Comp. Univ. Simon Bolivar.
157. m, n, (Spanish, English summary), Acta Cient. Venezolana 37, 484-494.
158. R.E. Giudici and C. Margaglio (1988), Chromatically equivalent graphs, Ars Combin. 25B, 221-229.
159. R.E. Giudici and C. Margaglio (1991), Chromaticity of supercycles of four cells, Proc. Sixth Caribbean Conf. on Combin. and Comput. 6, 185-198.
160. R.E. Giudici and M.Y. Melián (1988a), Chromatic uniqueness of 3-face graphs, Report No. 88-05, Dpto. de Mat y Ciencia de la Comp., Univ. Simon Bolivar.
161. R.E. Giudici and M.Y. Melián (1988b), Chromatic uniqueness of the supercycle C(b, a, a, a), Report No. 3-88, Escuela de Matemáticas, Universidad Metropolitana.
162. R.E. Giudici and R.M. Vinke (1980), A table of chromatic polynomials, J. Combin. Inform, and Syst. Sci. 5, 323-350.
163. C. D. Godsil and I. Gutman (1981), On the theory of matching polynomial, J. Graph Theory 5, 137-144.
164. 6. Ars Combin. 20, B, 107-111.
165. Z.Y. Guo (1997), On T-chromatic uniqueness of graphs, Discrete Math. 172, 45-51.
166. Z.Y. Guo and Y.J. Li (1989), Chromatic uniqueness of complement of the cycle union, J. Wuhan Urban Construction Inst. 6 (No.1), 1-9.
167. 4 homeomorphs, Discrete Math. 172, 53-58.
168. P. Guta (1997), The chromaticity of a generalized wheel graph, Australas. J. of Combin. 15, 295-298.
169. G. Haggard and T.R. Mathies (1999), The computation of chromatic polynomials, Discrete Math. 199, 227-231.
170. G. Haggard and T.R. Mathies (2001), Using thresholds to compute chromatic polynomials, Ars Combin. 58, 85-95.
171. B. T. Han (1986), Chromaticity of q-trees (Chinese), Kexue Tongbao 31 (15), 1200.
172. k-trees (Chinese), Acta Math. Appl. Sinica 11, no. 4, 457-467.
173. S. Hernandez and F. Luca (2005), Integer roots chromatic polynomials of non-chordal graphs and the Prouhet-Tarry-Escott problem, preprint.
174. S.G. Hoggar (1974), Chromatic polynomials and logarithmic concavity, J. Combin. Theory Ser. B 16, 226-239.
175. N. Homobono and C. Peyrat (1989), Graphs such that every two edges are contained in a shortest cycle, Discrete Math. 76, 37-44.
176. Y. Hong (1984), A note on the coefficients of chromatic polynomials (Chinese), J. East China Norm. Univ. Natur. Sci. Ed., no. 4, 33-35.
177. 4-homeomorphs, Pure and Appl. Math. 14, no. 1, 14-16.
178. B. Jackson (1993), A zero-free interval for chromatic polynomials of graphs, Combin. Probab. Comput. 2, 325-336.
179. B. Jackson and A.D. Sokal (2003), Maxmaxflow and Counting Subgraphs, draft.
180. K.R. James and W. Riha (1975), “Algorithm 24: Algorithm for deriving the chromatic polynomial of a graph”, Computing 14, 195-203.
181. R. Jiang (1999), The chromatic uniqueness of the complements of graphs that are G = (p, p+ 1) and R(G) = -2, J. Qinghai Normal Univ. (Natural Sc.), no. 3, 8-13.
182. R. Jiang and S.Z. Wang (2001), The chromatic uniqueness of the complements of several classes of graphs that are G = (p, p + 1) and R(G) = -2, J. Qinghai Normal Univ. (Natural Sc.), no. 4, 5-9.
183. Z.C. Jin (2001), Chromatic uniqueness of the complement of, J. Qinghai Normal Univ. (Natural Sc.), no. 2, 4-8.
184. K.M. Koh and B.H. Goh (1990), Two classes of chromatically unique graphs, Discrete Math. 82, 13-24.
185. K.M. Koh and C.P. Teo (1990a), The chromatic uniqueness of graphs related to broken wheels, Research Report No. 413, Department of Math, National University of Singapore.
186. K.M. Koh and C.P. Teo (1990b), Some results on chromatically unique graphs, Proc. of Asian Math. Conf, 258-262.
187. K.M. Koh and C.P. Teo (1991a), The chromatic uniqueness of certain broken wheels, Discrete Math. 96, 65-69.
188. K.M. Koh and C.P. Teo (1991b), Chromatic equivalence of a graph and its complement, Bull. Inst. Combin. Applications 3, 81-82.
189. K.M. Koh and C.P. Teo (1996), Chromaticity of series-parallel graphs, Discrete Math. 154, 289-295.
190. K.M. Koh and K.L. Teo (1990), The search for chromatically unique graphs, Graphs and Combin. 6, no. 3, 259-285.
191. K.M. Koh and K.L. Teo (1994), Chromatic classes of 2-connected (n, n + 3)- graphs with at least two triangles, Discrete Math. 127, 243-258.
192. K.M. Koh and K.L. Teo (1997), The search for chromatically unique graphs, II, Discrete Math. 172, 59-78.
193. R.R. Korfhage (1978), σ-polynomials and graphs coloring, J. Combin. Theory Ser. B 24, 137-153.
194. R.R. Korfhage (1988), A note on quadratic s-polynomials, Discrete Math. 69, 195-196.
195. A. Kostochka (1982), A lower bound for the Hadwiger number of a graph as a function of the average degree of its vertices, Discret. Analyz. Novosibirsk 38, 37-58.
196. R.C. Laskar and W.R. Hare (1975), The chromatic polynomial of a complete r-partite graph, Amer. Math. Monthly 82, no. 7, 752-754.
197. F. Lazebnik (1990), New upper bounds for the greatest number of proper colorings of a (v, e)-graph, J. Graph Theory 14, no. 1, 25-29.
198. X.Q. Lan (1991), On the chromaticity of graphs (Chinese), J. Inner Mongolia Teachers Univ. (Natural Sc.), no. 2, 23-28.
199. N.Z. Li (1985), A criterion for σ-polynomial of a graph, J. Shanghai Second Polytech university, no.1, 85-90.
200. N.Z. Li (1987), On the new development of theory of chromatic polynomial of graph, J. Shanghai Second Polytech. Univ., no. 1, 1-9.
201. N.Z. Li (1988), On coefficients of σ-polynomials of graphs, J. Shanghai Sec. Polytechnic Univ. 1, 1-5.
202. N.Z. Li (1992a), The chromatic polynomials of disconnected unlabeled graphs (Chinese, English summary), J. Shanghai Sec. Polytechnic Univ. 9, 14-21.
203. N.Z. Li (1992b), On graphs having σ-polynomials of the same degree, Discrete Math. 110, 185-196.
204. N.Z. Li (1997), The list of chromatically unique graphs of order seven and eight, Discrete Math. 172, 193-221.
205. N.Z. Li, X.W. Bao and E.Y. Liu (1997), Chromatic uniqueness of the complements of certain forests, Discrete Math. 172, 79-84.
206. N.Z. Li and Z.Z. Feng (2002), Counterexamples against some families of chromatically unique graphs, Discrete Math. 243, 257-258.
207. N.Z. Li and R.Y. Liu (1990), The chromaticity of the complete ŕ-partite graph K(1, P2, …, Pt), J- Xinjiang Univ. Natur. Sci. 7, 95-96.
208. N.Z. Li, H.S.H. Sun and I.X. Wen (1995), Properties of chromatic polynomials of unlabeled graphs, J. Combin. Math. Combin. Comput. 17, 21-32.
209. N.Z. Li and E.G. Whitehead Jr. (1989), Classification of graphs having cubic σ-polynomials, Graph Theory and Its Applications: East and West, Ann. New York Acad. Sci. 576, 328-335.
210. 10, Discrete Math. 104, 197-199.
211. N.Z. Li and E.G. Whitehead Jr. (1993), The chromaticity of certain graphs with five triangles, Discrete Math. 122, 365-372.
212. N. Z. Li, E.G. Whitehead Jr. and S.J. Xu (1987), Classification of chromatically unique graphs having quadratic σ-polynomials, J. Graph Theory 11, 169-176.
213. W.M. Li (1987), Almost every A'4-homeomorph is chromatically unique, Ars Combin. 23, 13-35.
214. 4 homeomorphs (Chinese, English summary), Math. Appl. 4, 43-47.
215. W.X. Li and F. Tian (1978), Some problems concerning the chromatic polynomials of graphs (Chinese, English summary), Acta Math. Sinica 21, 223-230.
216. X.F. Li and X.S. Wei (2001), The chromatic uniqueness of a family of 5-bridge graphs (Chinese), J. Qinghai Normal Univ., no. 2, 12-17.
217. Y.X. Lin and F.J. Zhang (1989), Two short proofs on chromatic polynomials, Ars Combin. 27, 221-222.
218. B. L. Liu, Z.H. Zhou and G.Q. Tan (1993), The Akiyama-Harary problem for chromatic polynomials (Chinese, Chinese summary), Acta Math. Sci. (Chinese) 13, 252-255.
219. R.Y. Liu (1987), A new method to find chromatic polynomial of graph and its applications, Kexue Tongbao 32, 1508-1509.
220. R.Y. Liu (1990), Adjoint polynomial of graphs (Chinese, English summary), J. Qinghai Normal University, 1-9.
221. t) (Chinese, English summitry), J. System Sci. Math. Sci. 12, 207-214.
222. R.Y. Liu (1992b), Several results on adjoint polynomials of graphs (Chinese, English), J. Qinghai Normal University, 1-6.
223. q-1, Pure and Applied Math. Supplement (2) 9, 86-87.
224. R.Y. Liu (1994), Chromatic uniqueness of complements of union of irreducible cycles (Chinese, English and Chinese summaries), Math. Appl. 7, 200-205.
225. R.Y. Liu (1996), Chromatic uniqueness of a class of complementary graphs of trees (Chinese), Math. Appl. 9, suppl., 170-173.
226. R.Y. Liu (1997), Adjoint polynomials and chromatically unique graphs, Discrete Math. 172, 85-92.
227. R.Y. Liu and X.W. Bao (1993), Chromatic uniqueness of the complements of 2-regular graphs, Pure and Applied Math. Supplement (2) 9, 69-71.
228. R.Y. Liu and J.F. Wang (1992), On chromatic uniqueness of complement of union of cycles and paths (Chinese, English summary), Theoretical Computer Science 1, 112-126.
229. R.Y. Liu and L.C. Zhao (1997), A new method for proving chromatic uniqueness of graphs, Discrete Math. 171, 169-177.
230. R.Y. Liu, H.X. Zhao and C.F. Ye (2002), A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs, Preprint.
231. B. Loerinc (1978), Chromatic uniqueness of the generalized θ-graphs, Discrete Math. 23, 313-316.
232. B. M. Loerinc (1980), Computing chromatic polynomials for special families of graphs, Courant Computer Science Report #19, New York University.
233. B. Loerinc and E.G. Whitehead Jr. (1981), Chromatic polynomials for regular graphs and modified wheels, J. Combin. Theory Ser. B 31, no. 1, 54-61.
234. L. Lovász (1993), Combinatorial problems and exercises, Second edition, North-Holland Publishing Co., Amsterdam.
235. Lundow and Markström (2002), Research Report No 3, Math. Inst., Umeå Uni., Sweden.
236. W. Mader (1967), Homomorphieeigenschaften und mittlere Kantendichte von Graphen. Math. Ann. 174, 265-268.
237. M. Marden (1966), Geometry of polynomials, Second edition, Mathematical Surveys, No. 3 American Mathematical Society, Providence, R.I. xiii+243 pp.
238. G. H.J. Meredith (1972), Coefficients of chromatic polynomials, J. Combin. Theory Ser. B 13, 14-17.
239. M. Mosca (1998), Removing edges can increase the average number of colors in the colorings of a graph, Combin. Probab. Comput. 7, 211-216.
240. A. Nijenhuis and H.S. Wilf (1978), Combinatorial algorithms, New York.
241. B. Omoomi and Y.H. Peng (2001), Chromatic equivalence classes of certain cycles with edges, Discrete Math. 232, 175-183.
242. B. Omoomi and Y.H. Peng (2003a), Chromatic equivalence classes of certain generalized polygon trees, II, Ars Combin. 68, 115-124.
243. B. Omoomi and Y.H. Peng (2003b), Chromatic equivalence classes of certain generalized polygon trees, III, Discrete Math. 271, 223-234.
244. Y.H. Peng (1991), On the chromatic uniqueness of certain bipartite graphs, Discrete Math. 94, no. 2, 129-140.
245. Y.H. Peng (1992a), On the chromatic coefficients of a bipartite graph, Ars Combin. 34, 107-117.
246. Y.H. Peng (1992b), Three families of chromatically unique graphs, Serdica 18, no. 1-2, 10-16.
247. Y.H. Peng (1992c), New infinite families of chromatically unique graphs, Sains Malaysiana. 21, no.4, 15-25.
248. Y.H. Peng (1993), On the chromatic uniqueness of certain trees of polygons, J. Australas. Math. Soc. Ser. A 55, no. 3, 403-410.
249. Y.H. Peng (1994), On the chromatic coefficients of a graph and chromatic uniqueness of certain n-partition graphs, in: Combinatorics, Graph Theory, Algorithms and Applications (Beijing, 1993) (World Scientific. River Edge, NJ), 307-316.
250. Y.H. Peng (1995), Another family of χ-unique graphs, Graphs and Combin. 11, 285-291.
251. 4 homeomorphs, Proceedings of the Second Asian Mathematical Conference 1995 (Nakhon Ratchasima), 283-286, World Sci. Publishing, River Edge, NJ.
252. 4-homeomorphs, Preprint.
253. Y.H. Peng and G.C. Lau (2004), Chromatic Classes of 2-connected (n, n + 4)- graphs with at least four triangles, Discrete Math. 278, 209-218.
254. Y.H. Peng, C.H.C. Little, K.L. Teo and H. Wang (1997), Chromatic equivalence classes of certain genralized polygon trees, Discrete Math. 172, 103-114.
255. 4- homeomorphs, Discrete Math. 258, 161-177.
256. M. Petkovšek (1984), Comparability line graphs, Graph theory (Novi Sad, 1983), 231-244, Univ. Novi Sad, Novi Sad.
257. P. Pitteloud (2003), Estimates of coefficients of chromatic polynomials and numbers of cliques of (c, n, m)-graphs, J. Graph Theory 42, 81-94.
258. R.B. Potts (1952), Some generalized order-disorder transformations, Math. Proc. Cambridge Philos. Soc. 48 (1952), 106-109.
259. A. Procacci, B. Scoppola and V. Gerasimov (2002), Potts model on infinite graphs and the limit of chromatic polynomials. Preprint.
260. R.C. Read (1967), Machine computation of the chromatic polynomials of graphs, with application to a cataloque of 7-node graphs, University of West Indies, Scientific Report UWI/CC8.
261. R.C. Read (1968), An introduction to chromatic polynomials, J. Combin. Theory 4, 52-71.
262. R.C. Read (1975), Reviewer’s remarks, MR50: 6906.
263. R.C. Read (1978), Some applications of computers in graph theory, in Selected Topics in Graph Theory, Academic Press, 417-444.
264. R.C. Read (1979), Algorithms in graph theory, in Applications of Graph Theory, Academic Press, 381-417.
265. R.C. Read (1981), A large family of chromatic polynomials, Proc. Caribbean Conf. on Combin. and Computing, University of the West Indies, Barbados, 23-41.
266. R.C. Read (1986), Broken wheels are SLC, Ars Combin. 21A, 123-128.
267. R.C. Read (1987a), An improved method for computing the chromatic polynomials of sparse graphs, Research Report CORR 87-20, C & O Dept. Univ. of Waterloo.
268. R.C. Read (1987b), Connectivity and chromatic uniqueness, Ars Combin. 23, 209-218.
269. R.C. Read (1987c), On the chromatic properties of graphs up to 10 vertices, Congr. Numer. 59, 243-255.
270. 10, Discrete Math. 69, 317.
271. R.C. Read (1988b), Recent advances in chromatic polynomial theory, Proc. Fifth Caribbean Conf. on Combin. and Comput. Barbados.
272. R.C. Read (1991), The computation of chromatic polynomials, Preprint.
273. R.C. Read and G.F. Royle (1991), Chromatic roots of families of graphs, Graph Theory, Combinatorics, and Applications, 1009-1029.
274. R.C. Read and W.T. Tutte (1988), Chromatic polynomials, in Selected Topics in Graph Theory 3, Academic Press, 15-42.
275. R.C. Read and E.G. Whitehead Jr. (1999), Chromatic polynomials of homeomorphism classes of graphs, Discrete Math. 204, 337-356.
276. 4-homeomorphs, Preprint.
277. 4-homeomorphs, Discrete Math. 252, 247-257.
278. 4-homeomorphs (Chinese), J. Math. Study 34, no. 1, 94-99.
279. H. Z. Ren and S.M. Zhang (2001), Chromatic uniqueness of a family of K4- homeomorphs, J. Qinghai Normal Univ. (Natural Sc.), no. 2, 9-11.
280. J. Riordan (1958), An introduction to combinatorial analysis, Wiley Publications in Mathematical Statistics, John Wiley & Sons, Inc., New York; Chapman & Hall, Ltd., London.
281. J. Rodriguez and A. Satyanarayana (1997), Chromatic polynomials with least coefficients, Discrete Math. 172, 115-119.
282. H. A. Roslan (2004), Chromaticity of certain bipartite graphs, Ph.D. thesis, Universiti Putra Malaysia.
283. A. Sakaloglu and A. Satyanarayana (1995), Graphs with least number of colorings, J. Graph Theory 19, no. 4, 523-533.
284. A. Sakaloglu and A. Satyanarayana (1997), Planar graphs with least chromatic coefficients, Discrete Math. 172, 121-130.
285. p-Z for | edges(Z)| ≤ 5, unpublished notes.
286. P.M. Salzberg, M.A. López and R.E. Giudici (1986), On the chromatic uniqueness of bipartite graphs, Discrete Math. 58, 285-294.
287. P. Seymour (1997), Two chromatic polynomial conjectures, J. Combin. Theory Ser. B 70, 184-196.
288. H. Shahmohamad and E.G. Whitehead Jr. (2002), Homeomorphs and amallam- orphs of the Petersen graph, Discrete Math. 250, 281-289.
289. R. Shrock (2001), Chromatic polynomials and their zeros and asymptotic limits for families of graphs, 17th British Combinatorial Conference (Canterbury, 1999), Discrete Math. 231, 421-446.
290. R. Shrock and S.H. Tsai (1997), Families of graphs with chromatic zeros lying on circles, Physical Review 56, no. 2, 1342-1345.
291. R. Shrock and S.H. Tsai (1998), Ground state entropy of Potts antiferromagnets: cases with noncompact W boundaries having points at 1/q = 0, J. Phys. A: Math. Gen. 31, 9641-9665.
292. R. Shrock and S.H. Tsai (1999), Ground state entropy of Potts antiferromagnets on cyclic polygon chain graphs, J. Phys. A 32, no. 27, 5053-5070.
293. A. D. Sokal (2000), Chromatic polynomials, potts models and all that, Physica A 279, 324-332.
294. A. D. Sokal (2001), Bounds on the complex zeros of (Di)chromatic polynomials and potts-model partition functions, Combin. Probab. Comput. 10, 41-77.
295. A. D. Sokal (2004), Chromatic roots are dense in the whole complex plane, Combin. Probab. Comput. 13, no. 2, 221-261.
296. R.P. Stanley (1973), Acyclic orientations of graphs, Discrete Math. 5, 171-178.
297. R.P. Stanley (1998), Graph colorings and related symmetric functions: ideas and applications: a description of results, interesting applications, & notable open problems, Selected papers in honor of Adriano Garsia (Taormina, 1994), Discrete Math. 193, 267-286.
298. D. M. Strickland (1997), Building fences around the chromatic coefficients, J. Graph Theory 26, 123-128.
299. J.R. Swenson (1973), The chromatic polynomial of a complete bipartite graph, Amer. Math. Monthly 80, 797-798.
300. M.Y. Tang (1996), The chromaticity of generalized q-wheels W(5+q) and W(7+ q) (Chinese), J. Shanghai Teachers Univ. (Natural Sc.) 25, no. 1, 31-32.
301. M.Y. Tang (1999), The chromaticity of generalized trees (Chinese), J. Shanghai Teachers Univ. (Natural Sciences) 28, no.3, 21-25.
302. C. P. Teo and K.M. Koh (1990), The chromaticity of complete bipartite graphs with at most one edge deleted, J. Graph Theory 14, 89-99.
303. C. P. Teo and K.M. Koh (1992), The number of shortest cycles and the chromatic uniqueness of a graph, J. Graph Theory 16, 7-15.
304. C. P. Teo and K.M. Koh (1994), On chromatic uniqueness of uniform subdivisions of graphs, Discrete Math. 128, 327-335.
305. K.L. Teo and K.M. Koh (1991), Chromatic classes of certain 2-connected (n, n + 2)-graphs, Ars Combin. 32, 65-76.
306. V. Thier (1983), “Graphen and Polynome”, Diploma thesis, TU, München.
307. A. Thomason (1984), An extremal function for complete subgraphs, Math. Proc. Camb. Phil. Soc. 95, 261-165.
308. C. Thomassen (1997), The zero-free intervals for chromatic polynomials of graphs, Combin. Probab. Comput. 6, 497-506.
309. C. Thomassen (2000), Chromatic roots and hamiltonian paths, J. Combin. Theory Ser. B 80, 218-224.
310. C. Thomassen (2001), Chromatic graph theory, Challenges for the 21st century (Singapore, 2000), 183-195, World Sci. Publishing, River Edge, NJ.
311. I. Tomescu (1972), Le nombre minimal de colorations d’un graphe, C.R. Acad. Sci. Paris Sér. A-B 274, A539-A542.
312. I. Tomescu (1985), Problems in combinatorics and graph theory, Translated from the Romanian by Robert A. Melter. Wiley-Interscience Series in Discrete Mathematics. A Wiley-Interscience Publication. John Wiley & Sons, Ltd., Chichester.
313. I. Tomescu (1987), On 3-colorings of bipartite p-threshold graphs, J. Graph Theory 11, 327-338.
314. I. Tomescu (1989), Some extremal results concerning the number of graph and hypergraph colorings, Proc. Combinatorics and Graph Theory, Banach Center Publ. 25, 187-194.
315. I. Tomescu (1990), Maximal chromatic polynomials of connected planar graphs, J. Graph Theory 14, 101-110.
316. I. Tomescu (1994a), On the sum of all distances in chromatic blocks, J. Graph Theory 18, 83-102.
317. I. Tomescu (1994b), Maximum chromatic polynomials of 2-connected graphs, J. Graph Theory 18, 329-336.
318. I. Tomescu (1997), Maximum chromatic polynomial of 3-chromatic blocks, Discrete Math. 172, 131-139.
319. W.T. Tutte (1954), A contribution to the theory of chromatic polynomials, Canad. J. Math. 6, 80-91.
320. W.T. Tutte (1970), On chromatic polynomials and the golden ratio, J. Combin. Theory 9, 289-296.
321. W.T. Tutte (1973), Chromatic sums for rooted planar triangulations: the cases λ = 1 and λ = 2, Canad. J. Math. 25, 426-447.
322. W.T. Tutte (1984), Graph Theory, Encyclopedia of Mathematics and its Applications, Addison-Wesley, Reading.
323. P. Vaderlind (1988), Chromaticity of triangulated graphs, J. Graph Theory 12, 245-248.
324. O.V. Vorodin and I.G. Dmitriev (1991), A characterization of chromatically rigid polynomials, Sibirskii Math. Zhumal 32, no. 1, 22-27.
325. D. G. Wagner (2000), Zeros of reliability polynomials and f-vectors of matroids, Combin. Probab. Comput. 9, no. 2, 167-190.
326. D. R. Wagner (1937), Über eine Erweiterung eines Satzes von Kuratowski, Deusche Math. 2, 280-285.
327. C. D. Wakelin (1993), The chromatic polynomial relative to the complete graph basis, Manuscript.
328. C. D. Wakelin and D.R. Woodall (1992), Chromatic polynomials, polygon trees, and outerplanar graphs, J. Graph Theory 16, 459-466.
329. T.R. Walsh (1997), Worst-case analysis of Read’s chromatic polynomial algorithm, Ars Combin. 46, 145-151.
330. L.G. Wang (1997), Chromatic uniqueness of three classes of graphs K E(G), J. Qinghai Normal University (Natural Sc), no. 3, 6-12.
331. L.G. Wang and R.Y. Liu (2001), Chromatic uniqueness for the complement of the union of irreducible í-shape trees (Chinese), Pure Appl. Math. 17, no. 2, 126-132, 137.
332. T. Wanner (1989), On the chromaticity of certain subgraphs of a q-tτee, J. Graph Theory 13, 597-605.
333. M.E. Watkins (1970), Connectivity of transitive graphs, J. Combin. Theory 8, 23-29.
334. W. Weickert (1983), Untersuchungen zum chromatischen Polynom anhand spezieller Basisdarstellungen, Diploma Thesis, TechoO Univ. Munchen.
335. D. J.A. Welsh (1993), Complexity: Knots, Colourings, and Counting, Vol. 186 of London Mathematical Society Lecture Notes, Cambridge Univ. Press, Cambridge/New York.
336. E. G. Whitehead Jr. (1975), Chromatic polynomials for chorded cycles, Proc. Sixth SEA Conf. on Combinatorics, Graph Theory and Computing, Utilitas Math., 619-625.
337. E.G. Whitehead Jr. (1978), Stirling number identities from chromatic polynomials, J. Combin. Theory Ser. A 24, 314-317.
338. E.G. Whitehead Jr. (1985), Chromaticity of two-trees, J. Graph Theory 9, 279-284.
339. E. G. Whitehead Jr. (1988), Chromatic polynomials of generalized trees, Discrete Math. 72, 391-393.
340. E. G. Whitehead Jr. (1989), Chromatic polynomials and the structure of graphs, Graph Theory and Its Applications: East and West, Ann. New York Acda. Sci. 576, 630-632.
341. E. G. Whitehead Jr. (1995), An improved algorithm for computing matching polynomials, Graph theory, combinatorics and algorithms, Vol. 1, 2 (Kalamazoo, MI, 1992), 1243-1247, Wiley-Intersci. Publ., Wiley, New York.
342. E. G. Whitehead Jr. (1996), Chromatic equivalent Ä'4-homeomorphs, Combinatorics, graph theory and algorithms vol. I, II (Kalamazoo, MI), 867-872.
343. E. G. Whitehead Jr. and L.C. Zhao (1984a), Chromatic uniqueness and equivalence of K4 homeomorphs, J. Graph Theory 8, 355-364.
344. E. G. Whitehead Jr. and L.C. Zhao (1984b), Cutpoints and the chromatic polynomial, J. Graph Theory 8, 371-377.
345. H. Whitney (1932a), The coloring of graphs, Ann. Math. (12) 33, 688-718.
346. H. Whitney (1932b), A logical expansion in mathematics, Bull. Amer. Math. Soc. 38, 572-579.
347. D. R. Woodall (1977), Zeros of chromatic polynomials, in Combinatorial Survey, Proc. Sixth British Combin. Conf. (ed. P.J. Cameron), Academic Press, 199-223.
348. D. R. Woodall (1992a), An inequality for chromatic polynomials, Discrete Math. 101, 327-331.
349. D. R. Woodall (1992b), A zero-free interval for chromatic polynomials, Discrete Math. 101, 333-341.
350. D. R. Woodall (1997), The largest real zero of the chromatic polynomial, Discrete Math. 172, 141-153.
351. D. R. Woodall (2002), Tutte polynomial expansions for 2-separable graphs, Discrete Math. 247, 201-213.
352. J. Xu and H. Li (1992), Chromatic polynomials of connection n-cycle graphs, J. Northwest Univ. 22, 147-152.
353. J. Xu and H. Li (1994), A new method of calculating chromatic polynomials: a recursive algorithm using vertex contraction (Chinese, English and Chinese summaries), J. Northwest Univ. 24, 103-105.
354. J. Xu and Z.H. Liu (1995), The chromatic polynomial between graph & its complement- about Akiyama and Harary’s open problem, Graphs and Combin. 11, no. 4, 337-345.
355. S.J. Xu (1983), Complete-graph-basis and the chromaticity of graphs with more edges, J. Shanghai Teachers College 3, 18-23.
356. S.J. Xu (1984), The chromaticity of regular graphs and bigraphs with more edges, J. Shanghai Teachers College 1, 10-18.
357. S.J. Xu (1987), Some notes on chromatic uniqueness of graphs (Chinese, English summary), J. Shanghai Teach. Univ., Nat. Sci. Ed. 2, 10-12.
358. S.J. Xu (1988), On σ-polynomials, Discrete Math. 69, 189-194.
359. S. J. Xu (1991a), The chromatic uniqueness of complete bipartite graphs, Discrete Math. 94, 153-159.
360. S. J. Xu (1991b), A lemma in studying chromaticity, Ars Combin. 32, 315-318.
361. S.J. Xu (1992), Corrigendum, Discrete Math. 104, 217.
362. 4-homeomorphs, Discrete Math. 117, 293-297.
363. S.J. Xu (1994), Classes of chromatically equivalent graphs and polygon trees, Discrete Math. 133, 267-278.
364. S.J. Xu (1997), Chromaticity of chordal graphs. Graphs and Combin. 13, no. 3, 287-294.
365. S.J. Xu and N.Z. Li (1984), The chromaticity of wheels, Discrete Math. 51, 207-212.
366. S.J. Xu, J.J. Liu and Y.H. Peng (1994), The chromaticity of s-bridge graphs and related graphs, Discrete Math. 135, 349-358.
367. S.J. Xu and J. Z. Zhang (1995), An inverse problem of the weighted shortest path problem, Japan J. Indust. Appl. Math. 12, no. 1, 47-59.
368. C. F. Ye (2001a), The chromatic uniqueness of 5-bridge graphs, J. Qinghai Normal Univ., no. 3, 1-5.
369. C. F. Ye (2001b), The chromatic uniqueness of 6-bridge graphs (Chinese), J. Math. Study. 34, no. 4, 399-421.
370. C. F. Ye (2001c), Graphs characterized by (Chinese), Pure Appl. Math. 17, no. 3, 246-251.
371. C. F. Ye (2002), The chromatic uniqueness of s-bridge graphs (Chinese), J. Xinjiang Univ. Natur. Sci. 19, no. 3, 261-265.
372. C. F. Ye and N.Z. Li (2002), Graphs with chromatic polynomial, Discrete Math. 259, 369-381.
373. C. F. Ye and R.Y. Liu (1994), Chromatic uniqueness of a new family of graphs (Chinese), Pure Appl. Math. 10, Special Issue, 46-53.
374. 4-homeomorphs (Chinese), Northeast. Math. J. 17, no. 2, 138-142.
375. 4-homeomorphs (Chinese), J. Ningbo Univ. 12, no. 2, 20-23.
376. Y.H. Zang and B.C. Yuan (1998), Characteristics of a class chromatic equivalence graph (Chinese), J. Northeast Normal Univ., no. 3, 46-48.
377. B. R. Zhang (1997), Chromatic uniqueness of, Pure and Appl. Math. 13, no. 1, 61-67.
378. 4-homeomorphs (Chinese), J. Qinghai Normal Univ. (Natural Sc.), no. 1, 12-16.
379. 3), J. Northeast Normal Univ., no. 2, 8-14.
380. H. X. Zhao (1997), Adjoint uniqueness of graphs with R(G) = -1, J. Qinghai Normal Univ. (Natural Sc.), no. 4, 6-10.
381. H. X. Zhao, B.F. Huo and R.Y. Liu (2000), Chromaticity of the complements of paths, J. Math. Study 33, no. 4, 345-353.
382. H. X. Zhao, X.L. Li, and R.Y. Liu (2003), A solution for some problems and conjectures on adjoint equivalent graphs, Preprint.
383. H. X. Zhao, X.L. Li and R.Y. Liu (2004), Chromaticity of the complements of some sparse graphs, Preprint.
384. H. X. Zhao, X.L. Li, R.Y. Liu and L.S. Wang (2002a), On the chromaticity of 4-partite graphs, Preprint.
385. H. X. Zhao, X.L. Li, R.Y. Liu and L.S. Wang (2002b), On the algebraic properties of the adjoint polynomials and chromaticity of two classes of graphs, Preprint.
386. H. X. Zhao, X.L. Li, R.Y. Liu and C.F. Ye (2004), The chromaticity of certain complete multipartite graphs, Graphs and Combin. 20, 423-434.
387. H. X. Zhao and R.Y. Liu (2001a), On the character of the matching polynomial and its application to circuit characterization of graphs, J. Combin. Math. Combin. Comput. 37, 75-86.
388. H. X. Zhao and R.Y. Liu (2001b), The necessary and sufficient condition of the irreducible paths, J. Northeast Normal Univ. 33 (2001), no. 2, 18-21.
389. H. X. Zhao, R.Y. Liu, X.L. Li and S.G. Zhang (2002), Chromatic uniqueness of the complement of L-shape graphs, preprint.
390. H. X. Zhao, R.Y. Liu and C.F. Ye (2003), On the chromatic uniqueness of tripartite graphs, preprint.
391. H. X. Zhao, R.Y. Liu and S.G. Zhang (2004), Classifications of complete 5-partite graphs and chromaticity of 5-partite graphs with 5n vertices, Appl. Math. J. Chinese Univ. Ser. B 19, no. 1, 116-124.
392. H. X. Zhao, X.L, Li, S.G. Zhang and R.Y. Liu (2004), On the minimum real roots of the σ-polynomial and chromatic uniqueness of graphs, Discrete Math. 281, 277-294.
393. n), Unpublished Notes.
394. H. W. Zou (1998a), The chromaticity of the complete tripartite graph K(n - 4, n, n) (Chinese), J. Shanghai Teachers Univ. (Natural Sc.) 27, no. 1, 37-43.
395. H. W. Zou (1998b), The chromaticity of the complete tripartite graph K(2,4,6) (Chinese), J. Shanghai Teachers Univ. (Natural Sc.) 27, no. 4, 14-17.
396. H. W. Zou (2000a), Classes of chromatically normal graphs of bipartite graphs K(m, n) - A (Chinese), Jiangxi Science 18, no. 2, 63-67.
397. 3), J. Sys. Sc. and Math. Sc. 20, no. 2, 181-186.
398. H. W. Zou (2002), Chromatic uniqueness of certain bipartite graphs K(m, n) - A(|A| ≥ 2) (Chinese), Tongji Daxue Xuebao Ziran Kexue Ban 30, no. 8, 1014-1018.
399. H. W. Zou (2004), The chromatic uniqueness of certain complete t-partite graphs, Discrete Math. 275, 375-383.
400. H. W. Zou and Y.B. Shi (1999), On the chromaticity of the complete tripartite graph K(n - k, n, n) (Chinese), J. Shanghai Teachers Univ. (Natural Sc.) 28, no. 1, 15-22.
401. H. W. Zou and Y.B. Shi (2000), On the chromaticity of the complete tripartite graph K(n, n, n + k) (Chinese), J. Shanghai Teachers Univ. (Natural Sc.) 29, no. 3, 29-35.
402. A.A. Zykov (1949), On some properties of linear complexes, (Russian) Mat. Sbomik N.S. 24 (66), 163-188.