The game $L(d,1)$-labeling problem of graphs (Q456896): Difference between revisions

@@ Property / cites work @@
+The $L(2,1)$-Labeling Problem on Graphs
@@ Property / cites work: The $L(2,1)$-Labeling Problem on Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A bound for the game chromatic number of graphs
@@ Property / cites work: A bound for the game chromatic number of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4201568
@@ Property / cites work: Q4201568 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3576665
@@ Property / cites work: Q3576665 / rank @@
+Normal rank
@@ Property / cites work @@
+Labelling Graphs with a Condition at Distance 2
@@ Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4256107
@@ Property / cites work: Q4256107 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple competitive graph coloring algorithm
@@ Property / cites work: A simple competitive graph coloring algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Radius two trees specify χ‐bounded classes
@@ Property / cites work: Radius two trees specify χ‐bounded classes / rank @@
+Normal rank
@@ Property / cites work @@
+A survey on labeling graphs with a condition at distance two
+Normal rank
@@ Property / cites work @@
+The game coloring number of planar graphs
@@ Property / cites work: The game coloring number of planar graphs / rank @@
+Normal rank

The game \(L(d,1)\)-labeling problem of graphs (Q456896): Difference between revisions