On the maximum number of colorings of a graph

DOI10.4310/JOC.2018.V9.N3.A4zbMath1387.05087arXiv1610.07208MaRDI QIDQ1750664

Aysel Erey

Publication date: 23 May 2018

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.07208

zbMATH Keywords

chromatic numberchromatic polynomial\(k\)-chromatic\(x\)-coloring

Mathematics Subject Classification ID

Graph polynomials (05C31) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (6)

Upper bounds on the chromatic polynomial of a connected graph with fixed clique number ⋮ A proof of Tomescu's graph coloring conjecture ⋮ Maximizing the number of \(x\)-colorings of 4-chromatic graphs ⋮ Extremal colorings and independent sets ⋮ The maximum number of colorings of graphs of given order and size: a survey ⋮ Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs

This page was built for publication: On the maximum number of colorings of a graph