Chromatic polynomials with least coefficients

DOI10.1016/S0012-365X(96)00274-9zbMath0954.05021OpenAlexW2076126108MaRDI QIDQ1366784

Bernhard Rupp

Publication date: 5 February 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00274-9

zbMATH Keywords

chromatic polynomial

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Planar graphs with least chromatic coefficients ⋮ Extremal graphs for the Tutte polynomial ⋮ Dr. Charles L. Suffel: Scholar, teacher, mentor, friend

Cites Work

• Parallel concepts in graph theory
• Acyclic orientations of graphs
• Least reliable networks and the reliability domination
• Graphs with least number of colorings

This page was built for publication: Chromatic polynomials with least coefficients