Mean color numbers of some graphs

DOI10.1007/S00373-021-02412-8zbMath1481.05050OpenAlexW4200177341MaRDI QIDQ2062899

Han Ren, Shu-De Long

Publication date: 3 January 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02412-8

zbMATH Keywords

chromatic polynomialwheelsimplicial vertexmean color number

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two chromatic polynomial conjectures
• Bounds for mean colour numbers of graphs
• Proof of a chromatic polynomial conjecture
• Further results on the lower bounds of mean color numbers
• Expansions of Chromatic Polynomials and Log-Concavity
• Removing Edges Can Increase the Average Number of Colours in the Colourings of a Graph
• The Markov chain of colourings

This page was built for publication: Mean color numbers of some graphs