On bounding the difference between the maximum degree and the chromatic number by a constant (Q2403810): Difference between revisions

@@ Property / describes a project that uses @@
+House of Graphs
@@ Property / describes a project that uses: House of Graphs / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2016.11.018
+Normal rank
@@ Property / OpenAlex ID @@
+W2962870170
@@ Property / OpenAlex ID: W2962870170 / rank @@
+Normal rank
@@ Property / cites work @@
+House of Graphs: a database of interesting graphs
@@ Property / cites work: House of Graphs: a database of interesting graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5782525
@@ Property / cites work: Q5782525 / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing Berge graphs
@@ Property / cites work: Recognizing Berge graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+On bounding the difference of the maximum degree and the clique number
+Normal rank
@@ Property / cites work @@
+Q4871751
@@ Property / cites work: Q4871751 / rank @@
+Normal rank