Minimal \(k\)-rankings for prism graphs

DOI10.2140/involve.2010.3.183zbMath1221.05159OpenAlexW2155566434MaRDI QIDQ992551

Mirko Horňák, Andrew Zemke, Hala King, Darren A. Narayan, Juan Carlos Ortiz

Publication date: 9 September 2010

Published in: Involve (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/involve.2010.3.183

zbMATH Keywords

vertex coloring\(k\)-rankingsprism graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Maximizing the number of edges in optimal \(k\)-rankings, 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