Minimal rankings and the arank number of a path

DOI10.1016/j.disc.2006.01.027zbMath1101.05040OpenAlexW2099361212MaRDI QIDQ2501577

Victor Kostyuk, Darren A. 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

zbMATH Keywords

vertex ranking

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (6)

On the small-\(\mu\) theorem ⋮ Arankings of trees ⋮ Minimal \(k\)-rankings and the rank number of \(P^2_n\) ⋮ Rank numbers of grid graphs ⋮ Greedy rankings and arank numbers ⋮ Max-optimal and sum-optimal labelings of graphs

Cites Work

• On a graph partition problem with application to VLSI layout
• On vertex ranking of a starlike graph
• Rankings of Graphs
• Minimal rankings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimal rankings and the arank number of a path