Optimal graphs for chromatic polynomials

DOI10.1016/J.DISC.2007.04.069MaRDI QIDQ2483402zbMATH OpenOpenAlexFDO

Authors Italo Simonelli

Publication date 28 April 2008

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2007.04.069

zbMATH Keywords

bipartite graphschromatic polynomialsupper and lower bounds

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 27256
• An attempt to classify bipartite graphs by chromatic polynomials
• Graph description by the chromatic polynomials
• The chromatic uniqueness of complete bipartite graphs
• scientific article; zbMATH DE number 165073

Cites work

• Coefficients of chromatic polynomials
• Graphs with least number of colorings
• scientific article; zbMATH DE number 4091530 (Why is no real title available?)
• Legal coloring of graphs
• On the greatest number of 2 and 3 colorings of a (v, e)-graph
• Some corollaries of a theorem of Whitney on the chromatic polynomial

Cited in

(6)

• Optimal graphs for independence and \(k\)-independence polynomials
• On bipartite graphs having minimum fourth adjacency coefficient
• Optimal domination polynomials
• The maximum number of colorings of graphs of given order and size: a survey
• On 4-Sachs optimal graphs
• Maximum number of colourings: 4-chromatic graphs

This page was built for publication: Optimal graphs for chromatic polynomials

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