Optimal \(r\)-dynamic coloring of sparse graphs (Q2424825): Difference between revisions

@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
+Normal rank
@@ Property / cites work @@
+An optimal square coloring of planar graphs
@@ Property / cites work: An optimal square coloring of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex arboricity of planar graphs without intersecting 5-cycles
+Normal rank
@@ Property / cites work @@
+The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
+Normal rank
@@ Property / cites work @@
+On dynamic coloring for planar graphs and graphs of higher genus
+Normal rank
@@ Property / cites work @@
+The entire chromatic number of graphs embedded on the torus with large maximum degree
+Normal rank
@@ Property / cites work @@
+Q3115232
@@ Property / cites work: Q3115232 / rank @@
+Normal rank
@@ Property / cites work @@
+On \(r\)-dynamic coloring of graphs
@@ Property / cites work: On \(r\)-dynamic coloring of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+-distance vertex-distinguishing index of subcubic graphs
+Normal rank
@@ Property / cites work @@
+Dynamic coloring and list dynamic coloring of planar graphs
+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 @@
+On \(r\)-hued coloring of \(K_4\)-minor free graphs
+Normal rank
@@ Property / cites work @@
+On \(r\)-hued coloring of planar graphs with girth at least 6
+Normal rank
@@ Property / cites work @@
+Minimum choosability of planar graphs
@@ Property / cites work: Minimum choosability of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
+Normal rank
@@ Property / cites work @@
+Planar graphs without chordal 5-cycles are 2-good
@@ Property / cites work: Planar graphs without chordal 5-cycles are 2-good / rank @@
+Normal rank
@@ Property / cites work @@
+Edge coloring of planar graphs without adjacent 7-cycles
+Normal rank
@@ Property / cites work @@
+Upper bounds for adjacent vertex-distinguishing edge coloring
+Normal rank
@@ Property / cites work @@
+Minimum 2-distance coloring of planar graphs and channel assignment
+Normal rank