Maximizing the number of \(x\)-colorings of 4-chromatic graphs

DOI10.1016/J.DISC.2017.09.028zbMath1383.05099arXiv1610.07219OpenAlexW2539760540MaRDI QIDQ1709544

Aysel Erey

Publication date: 5 April 2018

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

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

zbMATH Keywords

subdivisionchromatic numberchromatic polynomialtheta graph\(k\)-connected graph\(k\)-chromatic\(x\)-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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 ⋮ Extremal colorings and independent sets ⋮ The maximum number of colorings of graphs of given order and size: a survey ⋮ Maximum number of colourings: 4-chromatic graphs ⋮ Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Extremal \(H\)-colorings of trees and 2-connected graphs
• Maximizing proper colorings on graphs
• A strengthening of the Kuratowski planarity criterion for 3-connected graphs
• Typical subgraphs of 3- and 4-connected graphs
• On the maximum number of colorings of a graph
• On the chromatic roots of generalized theta graphs
• New bounds for chromatic polynomials and chromatic roots
• Maximizing the number of q -colorings
• The Bipartite Swapping Trick on Graph Homomorphisms
• Maximal chromatic polynomials of connected planar graphs
• Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree
• An Extremal Property of Turán Graphs, II

This page was built for publication: Maximizing the number of \(x\)-colorings of 4-chromatic graphs