An Extremal Property of Turán Graphs, II
From MaRDI portal
Publication:5417822
Recommendations
- scientific article; zbMATH DE number 3970790
- An extremal property of Turán graphs
- Another extremal property of some Turán graphs
- Another extremal problem for Turan graphs
- The Extremality of 2-Partite Turán Graphs with Respect to the Number of Colorings
- Some extremal results on hypergraph Turán problems
- scientific article; zbMATH DE number 3819765
- On the Turán properties of infinite graphs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- A hypergraph extension of Turán's theorem
Cites work
- A theoretical analysis of backtracking in the graph coloring problem
- 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
- Maximum number of colorings of (2k, k2)‐graphs
- Turán graphs and the number of colorings
Cited in
(9)- Maximizing the number of x-colorings of 4-chromatic graphs
- Another extremal property of some Turán graphs
- The maximum number of colorings of graphs of given order and size: a survey
- A proof of Tomescu's graph coloring conjecture
- Note on Turán's graph
- Maximizing proper colorings on graphs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- The Extremality of 2-Partite Turán Graphs with Respect to the Number of Colorings
- An extremal property of Turán graphs
This page was built for publication: An Extremal Property of Turán Graphs, II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5417822)