共 50 条
- [21] On Bounding the Difference of the Maximum Degree and the Clique Number Graphs and Combinatorics, 2015, 31 : 1689 - 1702
- [27] Better inapproximability results for MaxClique, chromatic number and Min-3Lin-Deletion AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, 2006, 4051 : 226 - 237
- [28] Upper Bounds on the Chromatic Polynomial of a Connected Graph with Fixed Clique Number Graphs and Combinatorics, 2023, 39
- [29] Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions COMBINATORIAL OPTIMIZATION, ISCO 2016, 2016, 9849 : 38 - 49