A lower bound for on-line ranking number of a path

DOI10.1016/j.disc.2005.11.072zbMath1115.05047OpenAlexW1982793783MaRDI QIDQ878626

Mirko Horňák, Erik Bruoth

Publication date: 26 April 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.072

zbMATH Keywords

rankingpathranking numberon-line ranking number

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (2)

A note on on-line ranking number of graphs ⋮ Greedy rankings and arank numbers

Cites Work

• Optimal node ranking of trees
• Local optimization on graphs
• Edge ranking of graphs is hard
• Ordered colourings
• On the vertex ranking problem for trapezoid, circular-arc and other graphs
• On-line rankings of graphs
• A note on on-line ranking number of graphs
• Rankings of Graphs
• On-line ranking number for cycles and paths
• Rankings of Directed Graphs
• Minimal rankings
• Unnamed Item

This page was built for publication: A lower bound for on-line ranking number of a path