scientific article; zbMATH DE number 1512685

MaRDI QIDQ4508372zbMATH OpenFDO

Authors David Avis, Caterina De Simone, Paolo Nobili

Publication date 16 August 2001

zbMATH Keywords

chromatic numberchromatic polynomialclique numbervertex colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Two chromatic polynomial conjectures
• Proof of a chromatic polynomial conjecture
• On partial sums of chromatic polynomials
• A note on the shameful conjecture
• Some inequalities on chromatic polynomials

Cited in

(12)

• The chromatic polynomial of \(P_2\times P_n\) and \(C_3\times P_n\)
• Two chromatic polynomial conjectures
• Proof of a chromatic polynomial conjecture
• A note on the shameful conjecture
• Some corollaries of a theorem of Whitney on the chromatic polynomial
• scientific article; zbMATH DE number 989238 (Why is no real title available?)
• scientific article; zbMATH DE number 4156470 (Why is no real title available?)
• A note on the conditional chromatic polynomial
• On Brenti's conjecture about the log-concavity of the chromatic polynomial
• Two Chromatic Conjectures: One for Vertices and One for Edges
• Upper bounds on the chromatic polynomial of a connected graph with fixed clique number
• A correlation inequality involving stable set and chromatic polynomials

This page was built for publication:

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