Greedy rankings and arank numbers
From MaRDI portal
Publication:989495
DOI10.1016/j.ipl.2009.03.028zbMath1197.05144MaRDI QIDQ989495
Garth Isaak, Darren A. Narayan, Robert E. Jamison
Publication date: 20 August 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.03.028
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
List rankings and on-line list rankings of graphs, Rank numbers of grid graphs, Max-optimal and sum-optimal labelings of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- A lower bound for on-line ranking number of a path
- Optimal node ranking of trees
- Minimal rankings and the arank number of a path
- Oriented list colorings of graphs
- On the equality of the grundy and ochromatic numbers of a graph
- On-line ranking number for cycles and paths
- Minimal rankings