An Extremal Property of Turán Graphs, II
From MaRDI portal
Publication:5417822
DOI10.1002/jgt.21739zbMath1288.05103OpenAlexW1518330846MaRDI QIDQ5417822
Publication date: 22 May 2014
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21739
Graph polynomials (05C31) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15)
Related Items (5)
The Extremality of 2-Partite Turán Graphs with Respect to the Number of Colorings ⋮ A proof of Tomescu's graph coloring conjecture ⋮ Maximizing the number of \(x\)-colorings of 4-chromatic graphs ⋮ Maximizing proper colorings on graphs ⋮ The maximum number of colorings of graphs of given order and size: a survey
Cites Work
- An extremal property of Turán graphs
- Backtrack: An O(1) expected time algorithm for the graph coloring problem
- Legal coloring of graphs
- Maximizing the number of q -colorings
- Turán Graphs and the Number of Colorings
- A theoretical analysis of backtracking in the graph coloring problem
- Maximum number of colorings of (2k, k2)‐graphs
This page was built for publication: An Extremal Property of Turán Graphs, II
