Towards the Chen-Raspaud conjecture (Q6177406): Difference between revisions

@@ Property / cites work @@
+Every planar map is four colorable. I: Discharging
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. II: Reducibility
+Normal rank
@@ Property / cites work @@
+Q3936766
@@ Property / cites work: Q3936766 / rank @@
+Normal rank
@@ Property / cites work @@
+Homomorphisms from sparse graphs to the Petersen graph
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Link scheduling in polynomial time
@@ Property / cites work: Link scheduling in polynomial time / rank @@
+Normal rank
@@ Property / cites work @@
+Q4828516
@@ Property / cites work: Q4828516 / rank @@
+Normal rank
@@ Property / cites work @@
+\(n\)-tuple coloring of planar graphs with large odd girth
+Normal rank
@@ Property / cites work @@
+The footballers of Croam
@@ Property / cites work: The footballers of Croam / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum bipartite subgraphs of Kneser graphs
@@ Property / cites work: Maximum bipartite subgraphs of Kneser graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of χ‐boundedness
@@ Property / cites work: A survey of χ‐boundedness / rank @@
+Normal rank
@@ Property / cites work @@
+The Mathematical Coloring Book
@@ Property / cites work: The Mathematical Coloring Book / rank @@
+Normal rank
@@ Property / cites work @@
+An inequality for the chromatic number of a graph
@@ Property / cites work: An inequality for the chromatic number of a graph / rank @@
+Normal rank