The search for chromatically unique graphs - II

Discrete Mathematics

Volumn 172, Issue 1-3, 1997, Pages 59-78

  Koh, K M ^a   Teo, K L ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002576204     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00269-5     Document Type: Article

References (66)

1. M. Behzad, G. Chartrand and L. Lesniak-Foster, Graphs and Digraphs (Prindle, Weber & Schmidt, Boston, MA, 1979).
2. M. Borowiecki and E. Drgas-Burchardt, Classes of chromatically unique graphs, Discrete Math. 111 (1993) 71-75.
3. C.Y. Chao and N.Z. Li, On trees of polygons, Arch. Math. 45 (1985) 180-185.
4. X.E. Chen, X.W. Bao and K.Z. Ouyang, Chromaticity of the graph θ(a,b,c,d), J. Shanxi Normal Univ. 20 (1992) 75-79 (in Chinese, English summary).
5. X.E. Chen and K.Z. Ouyang, Chromatic classes of certain 2-connected (n,n + 2)-graphs, J. Lanzhou Univ. (Natural sc.) 28 (1992) 183-184.
6. G.L. Chia, The chromaticity of wheels with a missing spoke, Discrete Math. 82 (1990) 209-212.
7. n), personal communication, 1992.
8. G.L. Chia, On the join of graphs and chromatic uniqueness, J. Graph Theory 19 (1995) 251-261.
9. G.L. Chia, The chromaticity of wheels with a missing spoke II, Discrete Math. 148 (1996) 305-310.
10. G.A. Dirac, A property of 4-chromatic graphs and some results on critical graphs, J. London Math. Soc. 27 (1952) 85-92.
11. F.M. Dong, On the uniqueness of chromatic polynomial of generalized wheel graph, J. Math. Res. Exposition 10 (1990) 447-454 (in Chinese, English summary).
12. F.M. Dong, The chromatic uniqueness of two classes of special graphs, Acta Math. Sinica 34 (1991) 242-251 (in Chinese).
13. F.M. Dong, On chromatic uniqueness of two infinite families of graphs, J. Graph Theory 17 (1993) 387-392.
14. F.M. Dong and K.M. Koh, On the structure and chromaticity of graphs in which any two colour classes induce a tree, Discrete Math., in press.
15. F.M. Dong and K.M. Koh, On graphs in which any pair of colour classes but one induces a tree, Discrete Math., in press.
16. F.M. Dong and Y.P. Liu, All wheels with two missing consecutive spokes are chromatically unique, Discrete Math., in press.
17. F.M. Dong and Y.P. Liu, On the chromatic uniqueness of the graph W(n,n - 2,k), Graphs and Combinatorics 12 (1996) 221-230.
18. k, Discrete Math. 145 (1995) 95-103.
19. F.M. Dong, Y.P. Liu and K.M. Koh, The chromaticity of odd wheels with a missing chord, New Zealand J. Math., in press.
20. Q.Y. Du, On σ-polynomials and a class of chromatically unique graphs, Discrete Math. 115 (1993) 153-165.
21. Q.Y. Du, Chromaticity of the complements of paths and cycles, preprint, 1994.
22. Q.Y. Du, On σ-equivalence and χ-equivalence of graphs, J. Graph Theory 21 (1996) 211-217.
23. R.J. Duffin, Topology of series-parallel networks, J. Math. Anal. Appl. 10 (1965) 303-318.
24. E.J. Farrell and J.M. Guo, On the characterizing properties of the matching polynomial, to appear.
25. E.J. Farrell and E.G. Whitehead Jr., Connections between matching and chromatic polynomials, Internat. J. Math. Math. Sci. 15 (1992) 757-766.
26. R.E. Giudici and E. Lima de Sá, Chromatic uniqueness of certain bipartite graphs, Congressus Numerantium 76 (1990) 69-75.
27. R.E. Giudici and C. Margalio, Chromaticity of supercycles of four cells, Proc. 6th Caribbean Conf. on Combinatorics and Computing, vol. 6 (1991) 185-198.
28. Z.Y. Guo and N.Z. Li, The m-clique polynomial and its application to chromatic polynomials, in: Graph Theory, Combinatorics, Algorithms, and Applications (SIAM, Philadelphia, 1991) 331-341.
29. Z.Y. Guo and Y.J. Li, Chromatic uniqueness of complement of the cycles union, J. Wuhan Urban Construction Institute 6 (1989) 1-9 (in Chinese, English summary).
30. K.M. Koh and C.P. Teo, The chromatic uniqueness of graphs related to broken wheels, Research Report no. 413, Department of Mathematics, National University of Singapore, 1990.
31. K.M. Koh and C.P. Teo, Some results on chromatically unique graphs, Proc. Asian Math. Conf. (World Scientific, Singapore, 1990) 258-262.
32. K.M. Koh and C.P. Teo, The chromatic uniqueness of certain broken wheels, Discrete Math. 96 (1991) 65-69.
33. K.M. Koh and C.P. Teo, Chromaticity of series-parallel graphs, Discrete Math. 154 (1996) 289-295.
34. K.M. Koh and K.L. Teo, The search for chromatically unique graphs, Graphs Combin. 6 (1990) 259-285.
35. K.M. Koh and K.L. Teo, Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles, Discrete Math. 127 (1994) 243-258.
36. t), J. Xinjiang Univ. Natur. Sci. 7 (1990) 95-96.
37. N.Z. Li and E.G. Whitehead Jr., The chromaticity of certain graphs with five triangles, Discrete Math. 122 (1993) 365-372.
38. 4 homeomorphs, Math. Appl. 4 (1991) 43-47 (in Chinese, English summary).
39. t) J. System Sci. Math. Sci. 12 (1992) 207-214 (in Chinese, English summary).
40. q-1, Pure Appl. Math. 9 (Suppl. 2) (1993) 86-87.
41. R.Y. Liu, Adjoint polynomials and chromatically unique graphs, Discrete Math., in press.
42. R.Y. Liu and Z.Q. Chen, Two new classes of chromatically unique graphs, to appear.
43. R.Y. Liu and N.Z. Li, Chromatic uniqueness of connected vertex-transitive graphs, Math. Appl. 4 (1991) 50-53 (in Chinese, English summary).
44. 4 - E(G), J. Math. (Wuhan), in press (in Chinese).
45. R.Y. Liu and J.F. Wang, On chromatic uniqueness of complement of union of cycles and paths, Theoret. Comput. Sci. (China) 1 (1993) 112-126 (in Chinese, English summary).
46. Y.H. Peng, Chromatic uniqueness of certain K(2,4) homeomorphs (Bahasa Malaysia) Matematika 7 (1991) 101-111.
47. Y.H. Peng, On the chromatic uniqueness of certain bipartite graphs, Discrete Math. 94 (1991) 129-140.
48. Y.H. Peng, New infinite families of chromatically unique graphs, Sains Malaysiana (Quantitative Studies) 21 (1992) 15-25.
49. Y.H. Peng, Three families of chromatically unique graphs, Serdica 18 (1992) 10-16.
50. Y.H. Peng, On the chromatic coefficients of a bipartite Graph Ars. Combin. 34 (1992) 107-117.
51. Y.H. Peng, 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, 1994) 307-316.
52. Y.H. Peng, Another family of chromatically unique graphs, Graphs Combin. 11 (1995) 285-291.
53. Y.H. Peng, C.H.C. Little, K.L. Teo and H. Wang, Chromatic equivalence classes of certain generalized polygonal trees, Discrete Math., in press.
54. R.C. Read, Broken wheels are SLC, Ars Combin. 21A (1986) 123-128.
55. C.P. Teo and K.M. Koh, The chromaticity of complete bipartite graphs with at most one edge deleted, J. Graph Theory 14 (1990) 89-99.
56. C.P. Teo and K.M. Koh, The number of shortest cycles and the chromatic uniqueness of a graph, J. Graph Theory 16 (1992) 7-15.
57. C.P. Teo and K.M. Koh, On chromatic-uniqueness of uniform subdivisions of graphs, Discrete Math. 128 (1994) 327-335.
58. K.L. Teo and K.M. Koh, Chromatic classes of certain 2-connected (n, n + 2)-graphs, Ars Combin. 32 (1991) 65-76.
59. I. Tomescu, On the sum of all distances in chromatic blocks, J. Graph Theory 18 (1994) 83-102.
60. C.D. Wakelin and D.R. Woodall, Chromatic polynomials, polygon trees, and outerplanar graphs, J. Graph Theory 16 (1992) 459-466.
61. E.G. Whitehead, Jr., Chromatic polynomials of generalized trees, Discrete Math. 72 (1988) 391-393.
62. S. Xu, The chromatic uniqueness of complete bipartite graphs, Discrete Math. 94 (1991) 153-159.
63. 4-homeomorphs, Discrete Math. 117 (1993) 293-297.
64. S. Xu, Classes of chromatically equivalent graphs and polygon trees, Discrete Math. 133 (1994) 267-278.
65. S.J. Xu, J.J. Liu and Y.H. Peng, The chromaticity of s-bridge graphs and related graphs, Discrete Math. 135 (1994) 349-358.
66. C.F. Ye and R.Y. Liu, Chromatic uniqueness of a new family of graphs, Pure Appl. Math., in press.