Graphs with least number of colorings

DOI10.1002/jgt.3190190407zbMath0830.05029OpenAlexW2142003123MaRDI QIDQ4842706

No author found.

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

planar graphscliquechromatic polynomialblock number

Mathematics Subject Classification ID

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

Related Items (6)

Chromatic polynomials with least coefficients ⋮ Planar graphs with least chromatic coefficients ⋮ A bibliography on chromatic polynomials ⋮ Optimal domination polynomials ⋮ Optimal graphs for independence and \(k\)-independence polynomials ⋮ Optimal graphs for chromatic polynomials

Cites Work

• On rigid circuit graphs

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