On chromatic and flow polynomial unique graphs

Discrete Applied Mathematics

Volumn 156, Issue 12, 2008, Pages 2300-2309

  Duan, Yinghua ^a   Wu, Haidong ^b   Yu, Qinglin ^a,c  

^a NANKAI UNIVERSITY   (China)

^b UNIVERSITY OF MISSISSIPPI   (United States)

^c THOMPSON RIVERS UNIVERSITY   (Canada)

Author keywords

Chromatic and flow polynomials; Chromatic and flow unique graphs; T unique graphs and matroids; Tutte polynomials

Indexed keywords

CODES (SYMBOLS); GRAPH THEORY; MOLYBDENUM; POLYNOMIAL APPROXIMATION;

CHROMATIC AND FLOW POLYNOMIALS; CHROMATIC AND FLOW UNIQUE GRAPHS; CHROMATIC POLYNOMIALS; FLOW POLYNOMIALS; MATROIDS; OF GRAPHS; T-UNIQUE GRAPHS AND MATROIDS; TUTTE POLYNOMIALS;

POLYNOMIALS;

EID: 49149105483     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.10.010     Document Type: Article

References (19)

1. Birkhoff G.D. A determinant formula for the number of ways of coloring a map. Ann. of Math. 14 (1912) 42-46
2. Bollobás B. Modern Graph Theory. 2nd ed. (1998), Springer-Verlag New York, Inc.
3. J.E. Bonin, Personal communication with the second author
4. Bonin J.E., and Miller W.P. Characterizing combinatorial geometries by numerical invariants. Eur. J. Comb. 20 (1999) 713-724
5. Brylawski T., and Oxley J.G. The Tutte polynomial and its applications. In: White N. (Ed). Matroid Applications (1992), Cambridge University Press, Cambridge
6. Chao C.Y., and Whitehead Jr. E.G. On Chromatic Equivalence of Graphs. Springer Lecture Notes in Mathematics vol. 642 (1978), Springer-Verlag, Berlin 121-131
7. A.P. Heron, Matroid polynomials, in: Combinatorics (Proc. Conf. Combinatorial Math., Math. Inst.), Oxford, 1972, pp. 164-202
8. Jin X. On the coefficients of the flow polynomial. J. Xinjiang University (Natural science edition) 23 Supp. (2006) 53-57
9. Koh K.M., and Teo K.L. The search for chromatically unique graphs. Graphs Comb. 6 (1990) 259-285
10. Koh K.M., and Teo K.L. The search for chromatically unique graphs II. Discrete Math. 172 (1997) 59-78
11. de Mier A., and Noy M. On graphs determined by their Tutte polynomial. Graphs Comb. 20 (2004) 105-119
12. de Mier A., and Noy M. Tutte uniqueness of line graphs. Discrete Math. 301 (2005) 57-65
13. Márquez A., de Mier A., Noy M., and Revuelta M.P. Locally grid graphs: Classification and Tutte uniqueness. Discrete Math. 266 (2003) 327-352
14. Noy M. Graphs determined by polynomial invariants, Random generation of combinatorial objects and bijective combinatorics. Theoret. Comput. Sci. 307 (2003) 365-384
15. Oxley J.G. Matroid Theory (1992), Oxford University Press, New York
16. Read R.C. On the chromatic properties of graphs up to 10 vertices. Congr. Numer. 59 (1987) 243-255
17. Tutte W.T. A contribution to the theory of chromatic polynomials. Canad. J. Math. 6 (1954) 80-91
18. Welsh D.J.A. Matroid Theory. LMS Monographs vol. 8 (1976), Academic Press, London, New York
19. Whitney H. A logic expansion in mathematics. Bull. Amer. Math. Soc. 38 (1932) 572-579