Characterizing 4-critical graphs with Ore-degree at most seven (Q684124): Difference between revisions

@@ Property / cites work @@
+Q5782525
@@ Property / cites work: Q5782525 / rank @@
+Normal rank
@@ Property / cites work @@
+The Colouring of Maps
@@ Property / cites work: The Colouring of Maps / rank @@
+Normal rank
@@ Property / cites work @@
+Q5520564
@@ Property / cites work: Q5520564 / rank @@
+Normal rank
@@ Property / cites work @@
+Ore-type versions of Brooks' theorem
@@ Property / cites work: Ore-type versions of Brooks' theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Improved lower bounds on the number of edges in list critical and online list critical graphs
+Normal rank
@@ Property / cites work @@
+Graphs with chromatic number close to maximum degree
+Normal rank
@@ Property / cites work @@
+Ore's conjecture on color-critical graphs is almost true
+Normal rank
@@ Property / cites work @@
+Ore's conjecture for \(k=4\) and Grötzsch's theorem
+Normal rank
@@ Property / cites work @@
+A Brooks-type result for sparse critical graphs
@@ Property / cites work: A Brooks-type result for sparse critical graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5528475
@@ Property / cites work: Q5528475 / rank @@
+Normal rank