Greedy rankings and arank numbers

DOI10.1016/J.IPL.2009.03.028zbMATH Open1197.05144OpenAlexW2062037518MaRDI QIDQ989495FDOQ989495

Authors: Garth Isaak, Robert E. Jamison, Darren Narayan 

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

Recommendations

• On-line rankings of graphs
• Arankings of trees
• Greedy algorithms for generalized \(k\)-rankings of paths
• A note on on-line ranking number of graphs
• A lower bound for on-line ranking number of a path

zbMATH Keywords

graph algorithmsvertex coloringrank numberon-line ranking numberminimal rankings

Mathematics Subject Classification ID

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

Cites Work

• Optimal node ranking of trees
• Title not available (Why is that?)
• On-line ranking number for cycles and paths
• On the equality of the grundy and ochromatic numbers of a graph
• Minimal rankings and the arank number of a path
• Maximum minimal \(k\)-rankings of cycles.
• Minimal rankings
• A lower bound for on-line ranking number of a path
• Oriented list colorings of graphs

Cited In (4)

• List rankings and on-line list rankings of graphs
• Rank numbers of grid graphs
• Max-optimal and sum-optimal labelings of graphs
• A note on on-line ranking number of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989495)