Competitive colorings of oriented graphs
From MaRDI portal
Publication:5942566
zbMath0984.05032MaRDI QIDQ5942566
William T. jun. Trotter, Henry A. Kierstead
Publication date: 16 October 2001
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/121760
Combinatorics in computer science (68R05) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (19)
Homomorphisms and colourings of oriented graphs: an updated survey ⋮ A simple competitive graph coloring algorithm. III ⋮ Chromatic numbers of exact distance graphs ⋮ The game chromatic number and the game colouring number of cactuses ⋮ On a vertex-edge marking game on graphs ⋮ On coloring numbers of graph powers ⋮ Adapted game colouring of graphs ⋮ The game Grundy number of graphs ⋮ A simple competitive graph coloring algorithm. II. ⋮ Indicated coloring game on Cartesian products of graphs ⋮ Uniform orderings for generalized coloring numbers ⋮ Refined activation strategy for the marking game ⋮ On the weak 2-coloring number of planar graphs ⋮ Weak acyclic coloring and asymmetric coloring games ⋮ Game coloring the Cartesian product of graphs ⋮ The 6-relaxed game chromatic number of outerplanar graphs ⋮ On the relaxed colouring game and the unilateral colouring game ⋮ Colouring games on outerplanar graphs and trees ⋮ On game chromatic vertex-critical graphs
This page was built for publication: Competitive colorings of oriented graphs
