Greedy rankings and arank numbers
From MaRDI portal
Publication:989495
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
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)
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)