Minimal rankings and the arank number of a path
From MaRDI portal
Publication:2501577
DOI10.1016/J.DISC.2006.01.027zbMATH Open1101.05040OpenAlexW2099361212MaRDI QIDQ2501577FDOQ2501577
Authors: Victor Kostyuk, Darren Narayan, Victoria A. Williams 
Publication date: 14 September 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.01.027
Recommendations
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Rankings of Graphs
- Title not available (Why is that?)
- On a graph partition problem with application to VLSI layout
- On vertex ranking of a starlike graph
- Further results on minimal rankings
- Maximum minimal \(k\)-rankings of cycles.
- Theoretical and complexity results for minimal rankings
- Title not available (Why is that?)
- Minimal rankings
- Intermediate minimal \(k\)-rankings of graphs
Cited In (13)
- Title not available (Why is that?)
- Greedy rankings and arank numbers
- Rank numbers of grid graphs
- Graphs whose \(l_p\)-optimal rankings are \(l_{\infty}\) optimal
- Arankings of trees
- Minimal \(k\)-rankings and the rank number of \(P^2_n\)
- On the small-\(\mu\) theorem
- Intermediate minimal \(k\)-rankings of graphs
- Maximum minimal \(k\)-rankings of cycles.
- Minors of a class of Riordan arrays related to weighted partial Motzkin paths
- Maximum minimal rankings of oriented trees
- Max-optimal and sum-optimal labelings of graphs
- Further results on minimal rankings
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)
