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

DOI10.1016/J.IPL.2008.10.004zbMATH Open1286.05050OpenAlexW145243801MaRDI QIDQ976072FDOQ976072

Juan Carlos Ortiz, Sarah Novotny, Darren Narayan

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

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) 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
• Title not available (Why is that?)
• On vertex ranking of a starlike graph
• Minimal rankings and the arank number of a path
• Further results on minimal rankings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimal rankings
• Vertex rankings of chordal graphs and weighted trees

Cited In (7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976072)