Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs

DOI10.1137/19M1306646zbMath1468.05075arXiv1912.03236OpenAlexW3175515440WikidataQ123154508 ScholiaQ123154508MaRDI QIDQ4997140

Aysel Erey, Jacob Fox, Xiaoyu He, John Engbers

Publication date: 28 June 2021

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

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

zbMATH Keywords

graph coloringconnectivitychromatic polynomialTomescu's conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (1)

Upper bounds on the chromatic polynomial of a connected graph with fixed clique number

Cites Work

• Unnamed Item
• Unnamed Item
• Extremal \(H\)-colorings of trees and 2-connected graphs
• Maximizing proper colorings on graphs
• Maximum number of colourings: 4-chromatic graphs
• A reverse Sidorenko inequality
• Maximizing the number of \(x\)-colorings of 4-chromatic graphs
• On the maximum number of colorings of a graph
• Extremal colorings and independent sets
• Maximum number of colourings: 5-chromatic case
• New bounds for chromatic polynomials and chromatic roots
• A proof of Tomescu's graph coloring conjecture
• Maximizing the number of q -colorings
• Maximal chromatic polynomials of connected planar graphs
• Maximum chromatic polynomials of 2‐connected graphs
• On weighted graph homomorphisms
• Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree
• Maximising ‐colourings of graphs
• Extremal H‐Colorings of Graphs with Fixed Minimum Degree
• On Independent Circuits Contained in a Graph
• The structure of k-chromatic graphs

This page was built for publication: Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs