Partitioning of a graph into induced subgraphs not containing prescribed cliques (Q6180565): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2023.11.001
@@ Property / DOI: 10.1016/j.dam.2023.11.001 / rank @@
-Normal rank
@@ Property / cites work @@
+The complexity of \(G\)-free colourability
@@ Property / cites work: The complexity of \(G\)-free colourability / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Vertex Partitions
@@ Property / cites work: Optimal Vertex Partitions / rank @@
+Normal rank
@@ Property / cites work @@
+On an upper bound of the graph's chromatic number, depending on the graph's degree and density
+Normal rank
@@ Property / cites work @@
+Q5782525
@@ Property / cites work: Q5782525 / rank @@
+Normal rank
@@ Property / cites work @@
+Another bound on the chromatic number of a graph
@@ Property / cites work: Another bound on the chromatic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Brooks' graph-coloring theorem and the independence number
+Normal rank
@@ Property / cites work @@
+Vertex arboricity and maximum degree
@@ Property / cites work: Vertex arboricity and maximum degree / rank @@
+Normal rank
@@ Property / cites work @@
+The point-arboricity of a graph
@@ Property / cites work: The point-arboricity of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on Hitting Maximum and Maximal Cliques With a Stable Set
+Normal rank
@@ Property / cites work @@
+Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker
+Normal rank
@@ Property / cites work @@
+Graphs with $\chi=\Delta$ Have Big Cliques
@@ Property / cites work: Graphs with $\chi=\Delta$ Have Big Cliques / rank @@
+Normal rank
@@ Property / cites work @@
+Q3220612
@@ Property / cites work: Q3220612 / rank @@
+Normal rank
@@ Property / cites work @@
+Hitting all maximum cliques with a stable set using lopsided independent transversals
+Normal rank
@@ Property / cites work @@
+Q3909076
@@ Property / cites work: Q3909076 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with chromatic number close to maximum degree
+Normal rank
@@ Property / cites work @@
+Q5530470
@@ Property / cites work: Q5530470 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3320406
@@ Property / cites work: Q3320406 / rank @@
+Normal rank
@@ Property / cites work @@
+On hitting all maximum cliques with an independent set
+Normal rank
@@ Property / cites work @@
+\(\Delta \)-critical graphs with small high vertex cliques
+Normal rank
@@ Property / cites work @@
+Partitioning and coloring graphs with degree constraints
+Normal rank
@@ Property / cites work @@
+A strengthening of Brooks' theorem
@@ Property / cites work: A strengthening of Brooks' theorem / rank @@
+Normal rank
@@ Property / cites work @@
+A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2023.11.001
@@ Property / DOI: 10.1016/J.DAM.2023.11.001 / rank @@
+Normal rank