Minimal rankings and the arank number of a path
From MaRDI portal
Publication:2501577
Recommendations
Cites work
- scientific article; zbMATH DE number 2076918 (Why is no real title available?)
- scientific article; zbMATH DE number 1743759 (Why is no real title available?)
- Further results on minimal rankings
- Intermediate minimal \(k\)-rankings of graphs
- Maximum minimal \(k\)-rankings of cycles.
- Minimal rankings
- On a graph partition problem with application to VLSI layout
- On vertex ranking of a starlike graph
- Rankings of Graphs
- Theoretical and complexity results for minimal rankings
Cited in
(14)- Further results on minimal rankings
- Arankings of trees
- Maximum minimal rankings of oriented trees
- Greedy rankings and arank numbers
- Max-optimal and sum-optimal labelings of graphs
- Flanking numbers and arankings of cyclic graphs
- Minimal \(k\)-rankings and the rank number of \(P^2_n\)
- Rank numbers of grid graphs
- Intermediate minimal \(k\)-rankings of graphs
- Minors of a class of Riordan arrays related to weighted partial Motzkin paths
- On the small-\(\mu\) theorem
- Maximum minimal \(k\)-rankings of cycles.
- scientific article; zbMATH DE number 1743759 (Why is no real title available?)
- Graphs whose \(l_p\)-optimal rankings are \(l_{\infty}\) optimal
This page was built for publication: Minimal rankings and the arank number of a path
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2501577)