Mirko Hornák

Learn More
A k-ranking of a graph G is a colouring ϕ : V (G) → {1,. .. , k} such that any path in G with endvertices x, y fulfilling ϕ(x) = ϕ(y) contains an internal vertex z with ϕ(z) > ϕ(x). On-line ranking number χ * r (G) of a graph G is a minimum k such that G has a k-ranking constructed step by step if vertices of G are coming and coloured one by one in an(More)