On the chromatic polynomial of a graph

DOI10.1007/S101070100285zbMATH Open1001.05056OpenAlexW2039031224MaRDI QIDQ1849500FDOQ1849500

Authors: Caterina De Simone, Paolo Nobili, David Avis 

Publication date: 1 December 2002

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070100285

Recommendations

• Some inequalities on chromatic polynomials
• On upper bounds for real roots of chromatic polynomials
• Lower bounds and upper bounds for chromatic polynomials
• Proof of a chromatic polynomial conjecture
• On partial sums of chromatic polynomials

zbMATH Keywords

boundclique numberindependence numbercolour number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (18)

• New bounds for chromatic polynomials and chromatic roots
• On the absolute sum of chromatic polynomial coefficient of graphs
• An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\)
• On injective chromatic polynomials of graphs
• Note on chromatic polynomials of the threshold graphs
• Lower bounds and upper bounds for chromatic polynomials
• A note on the conditional chromatic polynomial
• Some inequalities on chromatic polynomials
• An inequality for chromatic polynomials
• Title not available (Why is that?)
• Proof of a chromatic polynomial conjecture
• Title not available (Why is that?)
• On partial sums of chromatic polynomials
• Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations
• Title not available (Why is that?)
• The chromatic polynomial of a digraph
• An attempt to classify bipartite graphs by chromatic polynomials
• Upper bounds on the chromatic polynomial of a connected graph with fixed clique number

This page was built for publication: On the chromatic polynomial of a graph

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