Greedy rankings and arank numbers

DOI10.1016/j.ipl.2009.03.028zbMath1197.05144OpenAlexW2062037518MaRDI 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

zbMATH Keywords

graph algorithmsvertex coloringrank numberon-line ranking numberminimal rankings

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

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

This page was built for publication: Greedy rankings and arank numbers