A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring (Q3512604): Difference between revisions

@@ Property / Wikidata QID @@
+Q60060517
@@ Property / Wikidata QID: Q60060517 / rank @@
+Normal rank
@@ Property / cites work @@
+A list analogue of equitable coloring
@@ Property / cites work: A list analogue of equitable coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Proof of the Seymour conjecture for large graphs
@@ Property / cites work: Proof of the Seymour conjecture for large graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The infamous upper tail
@@ Property / cites work: The infamous upper tail / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian square-paths
@@ Property / cites work: Hamiltonian square-paths / rank @@
+Normal rank
@@ Property / cites work @@
+Ore-type graph packing problems
@@ Property / cites work: Ore-type graph packing problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4716273
@@ Property / cites work: Q4716273 / rank @@
+Normal rank
@@ Property / cites work @@
+Equitable coloring and the maximum degree
@@ Property / cites work: Equitable coloring and the maximum degree / rank @@
+Normal rank
@@ Property / cites work @@
+Note on Hamilton Circuits
@@ Property / cites work: Note on Hamilton Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect Graphs and an Application to Optimizing Municipal Services
+Normal rank