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

DOI10.1002/JGT.10039MaRDI QIDQ4797922zbMATH OpenOpenAlexFDO

Authors Philippe Pitteloud

Publication date 10 March 2003

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.10039

zbMATH Keywords

chordal graphschromatic polynomialcliquevertex ordering

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 19199
• Upper bounds on the chromatic polynomial of a connected graph with fixed clique number
• scientific article; zbMATH DE number 989238
• On the absolute sum of chromatic polynomial coefficient of graphs
• On chromatic polynomials of some kinds of graphs
• THE CLIQUE NUMBERS AND CHROMATIC NUMBERS OF CERTAIN PALEY GRAPHS
• Some results on chromatic polynomials of hypergraphs
• Chromatic polynomials and their zeros and asymptotic limits for families of graphs
• scientific article; zbMATH DE number 3981199
• scientific article; zbMATH DE number 833904

Cited in

(1)

• scientific article; zbMATH DE number 2076811 (Why is no real title available?)

This page was built for publication: Estimates of coefficients of chromatic polynomials and numbers of cliques of (c,n,m)-graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4797922)