Minimal \(k\)-rankings and the rank number of \(P^2_n\)

DOI10.1016/J.IPL.2008.10.004zbMath1286.05050OpenAlexW145243801MaRDI QIDQ976072

Sarah Novotny, Darren A. Narayan, Juan Carlos Ortiz

Publication date: 16 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.10.004

zbMATH Keywords

graph algorithmsvertex coloringrank number\(k\)-th power of a pathminimal \(k\)-ranking

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Maximizing the number of edges in optimal \(k\)-rankings ⋮ \(l_p\)-optimal rankings and max-optimal rankings are different ⋮ Rank numbers for bent ladders ⋮ Graphs with large rank numbers and rank numbers of subdivided stars ⋮ Rank numbers of grid graphs ⋮ Rank numbers for some trees and unicyclic graphs ⋮ Max-optimal and sum-optimal labelings of graphs

Cites Work

• Vertex rankings of chordal graphs and weighted trees
• On a graph partition problem with application to VLSI layout
• On vertex ranking of a starlike graph
• Minimal rankings and the arank number of a path
• Rankings of Graphs
• Minimal rankings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimal \(k\)-rankings and the rank number of \(P^2_n\)