The \(r\)-dynamic chromatic number of planar graphs without special short cycles (Q6167022): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-031-16081-3_27
+Normal rank
@@ Property / OpenAlex ID @@
+W4296168628
@@ Property / OpenAlex ID: W4296168628 / rank @@
+Normal rank
@@ Property / cites work @@
+-Distance coloring of planar graph
@@ Property / cites work: 2-Distance coloring of planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+\(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)
+Normal rank
@@ Property / cites work @@
+Upper bounds of \(r\)-hued colorings of planar graphs
+Normal rank
@@ Property / cites work @@
+On \(r\)-hued coloring of planar graphs with girth at least 6
+Normal rank
@@ Property / cites work @@
+Optimal \(r\)-dynamic coloring of sparse graphs
@@ Property / cites work: Optimal \(r\)-dynamic coloring of sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum 2-distance coloring of planar graphs and channel assignment
+Normal rank
@@ Property / cites work @@
+List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles
+Normal rank