Estimates of coefficients of chromatic polynomials and numbers of cliques of (c,n,m)-graphs

Journal of Graph Theory

Volumn 42, Issue 2, 2003, Pages 81-94

  Pitteloud, Philippe ^a  

^a UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

Chordal graphs; Chromatic polynomial; Clique; Vertex ordering

Indexed keywords

EID: 0037328943     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.10039     Document Type: Article

References (7)

1. 1 C. Berge, Graphs, and Hypergraphs, North‐Holland, Amsterdam, 1985.
2. 2 N. Biggs, Algebraic Graph Theory, Cambridge Univ. Press, Cambridge, 1993.
3. 3 M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
4. 4 R. C. Read and W. T. Tutte, Chromatic polynomials, Selected Topics in Graph Theory III, L.W. Beineke and R. J. Wilson (Editors), Academic Press, New York ( 1988), 15–42.
5. 5 D. M. Strickland, Building fences around the chromatic coefficients, J Graph Theory 26 ( 1997), 123–128.
6. 6 H. Whitney, A logical expansion in mathematics, Bull Am Math Soc 38 ( 1932), 572–579.
7. 7 H. Wilf, Which polynomials are chromatic? Colloq Internaz sulle Teorie Combinatorie, 1973, B. Segre (Editor), Atti dei Convegni Lincei 17, Rome, 1976, 247–256.