Ranking numbers of graphs

DOI10.1016/j.ipl.2010.05.025zbMath1233.05173OpenAlexW2094313673MaRDI QIDQ765523

D. Kharzeev

Publication date: 19 March 2012

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

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

zbMATH Keywords

cyclepowercombinatorial problemsindependent setpathcompositionCartesian productvertex rankingcaterpillarranking numberminimal cut set

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

Maximizing the number of edges in optimal \(k\)-rankings ⋮ Uniqueness and minimal obstructions for tree-depth ⋮ \(l_p\)-optimal rankings and max-optimal rankings are different ⋮ Rank numbers for bent ladders ⋮ On 1-uniqueness and dense critical graphs for tree-depth ⋮ Rank numbers of grid graphs ⋮ Rank numbers for some trees and unicyclic graphs

Cites Work

• Optimal node ranking of trees
• Edge ranking of graphs is hard
• Optimal node ranking of tree in linear time
• Ordered colourings
• On the vertex ranking problem for trapezoid, circular-arc and other graphs
• Rankings of Graphs
• Minimal rankings

This page was built for publication: Ranking numbers of graphs