On \(r\)-hued coloring of \(K_4\)-minor free graphs (Q393165): Difference between revisions

@@ Property / cites work @@
+On the list dynamic coloring of graphs
@@ Property / cites work: On the list dynamic coloring of graphs / rank @@
+Normal rank
@@ 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 @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+On dynamic coloring for planar graphs and graphs of higher genus
+Normal rank
@@ Property / cites work @@
+Topology of series-parallel networks
@@ Property / cites work: Topology of series-parallel networks / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic list coloring of bipartite graphs
@@ Property / cites work: Dynamic list coloring of bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Conditional colorings of graphs
@@ Property / cites work: Conditional colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5466088
@@ Property / cites work: Q5466088 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of conditional colorability of graphs
@@ Property / cites work: Complexity of conditional colorability of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring the square of a \(K_{4}\)-minor free graph
+Normal rank
@@ Property / cites work @@
+The four-colour theorem
@@ Property / cites work: The four-colour theorem / rank @@
+Normal rank