On-line ranking number for cycles and paths

DOI10.7151/dmgt.1094zbMath0958.05076OpenAlexW2025800297MaRDI QIDQ4498984

Mirko Horňák, Erik Bruoth

Publication date: 9 April 2001

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/41deb94943e8b396a45ffa63530e077ec583d37c

zbMATH Keywords

colouringpathranking number

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (13)

List rankings and on-line list rankings of graphs ⋮ Extrema property of the \(k\)-ranking of directed paths and cycles ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ A lower bound for on-line ranking number of a path ⋮ 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 ⋮ Facial edge ranking of plane graphs ⋮ Graphs with large rank numbers and rank numbers of subdivided stars ⋮ A note on on-line ranking number of graphs ⋮ Rank numbers for some trees and unicyclic graphs ⋮ Greedy rankings and arank numbers

This page was built for publication: On-line ranking number for cycles and paths