Planar graphs with least chromatic coefficients

DOI10.1016/S0012-365X(96)00275-0zbMath0954.05022OpenAlexW2098972345MaRDI QIDQ1366785

Bernhard Rupp

Publication date: 17 September 1997

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

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

zbMATH Keywords

chromatic polynomialcolorchromatic coefficients

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Cites Work

• On rigid circuit graphs
• Parallel concepts in graph theory
• Chromatic polynomials with least coefficients
• Least reliable networks and the reliability domination
• Graphs with least number of colorings