Max-optimal and sum-optimal labelings of graphs

DOI10.1016/J.IPL.2011.09.006zbMath1232.05080OpenAlexW2028918432MaRDI QIDQ763483

Robert E. Jamison, Darren A. Narayan

Publication date: 9 March 2012

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

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

zbMATH Keywords

graph algorithmsvertex coloringrank number

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 (1)

\(l_p\)-optimal rankings and max-optimal rankings are different

Cites Work

• Vertex ranking of asteroidal triple-free graphs
• Minimal \(k\)-rankings and the rank number of \(P^2_n\)
• Greedy rankings and arank numbers
• On a graph partition problem with application to VLSI layout
• On chromatic sums and distributed resource allocation
• On vertex ranking of a starlike graph
• On sum coloring of graphs
• 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
• Unnamed Item

This page was built for publication: Max-optimal and sum-optimal labelings of graphs