Graphs with least number of colorings

DOI10.1002/JGT.3190190407MaRDI QIDQ4842706zbMATH OpenOpenAlexFDO

Authors

Publication date 28 January 1996

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

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

zbMATH Keywords

block numberchromatic polynomialcliqueplanar graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Recommendations

• Graphs with chromatic numbers strictly less than their colouring numbers
• Minimum order of graphs with given coloring parameters
• Minimal coloring and strength of graphs
• Colour-critical graphs with few edges
• The coloring of graphs
• Total colorings of graphs with minimum sum of colors
• Coloring Graphs with Minimal Edge Load
• Graph colorings
• Graphs with the fewest matchings

Cites work

• On rigid circuit graphs

Cited in

(9)

• Chromatic polynomials with least coefficients
• Planar graphs with least chromatic coefficients
• A bibliography on chromatic polynomials
• Optimal graphs for independence and \(k\)-independence polynomials
• Some algebraic methods for calculating the number of colorings of a graph
• Optimal domination polynomials
• Optimal graphs for chromatic polynomials
• New upper bounds for the greatest number of proper colorings of a (V,E)‐graph
• Graphs with the fewest matchings

This page was built for publication: Graphs with least number of colorings

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