How well can a graph be n-colored? (Q1148324): Difference between revisions

@@ Property / Wikidata QID @@
+Q92200966
@@ Property / Wikidata QID: Q92200966 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+On the Fundamental Problem of Mathematics
@@ Property / cites work: On the Fundamental Problem of Mathematics / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Near-Optimal Graph Coloring
@@ Property / cites work: The Complexity of Near-Optimal Graph Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Two-Processor Scheduling with Start-Times and Deadlines
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4194705
@@ Property / cites work: Q4194705 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1148324