Greedy rankings and arank numbers (Q989495): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2009.03.028
+Normal rank
@@ Property / OpenAlex ID @@
+W2062037518
@@ Property / OpenAlex ID: W2062037518 / rank @@
+Normal rank
@@ Property / cites work @@
+On-line ranking number for cycles and paths
@@ Property / cites work: On-line ranking number for cycles and paths / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for on-line ranking number of a path
+Normal rank
@@ Property / cites work @@
+On the equality of the grundy and ochromatic numbers of a graph
+Normal rank
@@ Property / cites work @@
+Minimal rankings
@@ Property / cites work: Minimal rankings / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal node ranking of trees
@@ Property / cites work: Optimal node ranking of trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4470341
@@ Property / cites work: Q4470341 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2931464
@@ Property / cites work: Q2931464 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal rankings and the arank number of a path
@@ Property / cites work: Minimal rankings and the arank number of a path / rank @@
+Normal rank
@@ Property / cites work @@
+Oriented list colorings of graphs
@@ Property / cites work: Oriented list colorings of graphs / rank @@
+Normal rank