Rank numbers of grid graphs
From MaRDI portal
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?)
- scientific article; zbMATH DE number 1414315 (Why is no real title available?)
- An optimal parallel algorithm for node ranking of cographs
- Further results on minimal rankings
- Greedy rankings and arank numbers
- Maximum minimal \(k\)-rankings of cycles.
- Minimal \(k\)-rankings and the rank number of \(P^2_n\)
- Minimal \(k\)-rankings for prism graphs
- Minimal rankings
- Minimal rankings and the arank number of a path
- On the vertex ranking problem for trapezoid, circular-arc and other graphs
- On vertex ranking of a starlike graph
- Optimal node ranking of tree in linear time
- Optimal node ranking of trees
- Optimal vertex ranking of block graphs
- Ranking numbers of graphs
- Rankings of Graphs
- Theoretical and complexity results for minimal rankings
- Vertex ranking of asteroidal triple-free graphs
- Vertex rankings of chordal graphs and weighted trees
Cited in
(13)- Infinite graphs with finite \(l_p\)-rank number: a characterization
- Arankings of trees
- \(l_p\)-optimal rankings and max-optimal rankings are different
- On the rank number of the Cartesian product \(K_m \square K_n\)
- Voltage graphs
- The birank number of ladder, prism and Möbius ladder graphs
- Rank numbers for bent ladders
- Maximizing the number of edges in optimal \(k\)-rankings
- scientific article; zbMATH DE number 798644 (Why is no real title available?)
- Minimal \(k\)-rankings for prism graphs
- The Rank-Width of the Square Grid
- Rank numbers for some trees and unicyclic graphs
- Graphs with large rank numbers and rank numbers of subdivided stars
This page was built for publication: Rank numbers of grid graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q712259)
