Greedy rankings and arank numbers
From MaRDI portal
Publication:989495
Recommendations
Cites work
- scientific article; zbMATH DE number 2076918 (Why is no real title available?)
- A lower bound for on-line ranking number of a path
- Maximum minimal \(k\)-rankings of cycles.
- Minimal rankings
- Minimal rankings and the arank number of a path
- On the equality of the grundy and ochromatic numbers of a graph
- On-line ranking number for cycles and paths
- Optimal node ranking of trees
- Oriented list colorings of graphs
Cited in
(5)
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)