A simple competitive graph coloring algorithm
From MaRDI portal
Publication:1569067
DOI10.1006/jctb.1999.1927zbMath1024.05029OpenAlexW4213136504MaRDI QIDQ1569067
Publication date: 25 June 2000
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/f7c5ae5c5bb5edd4c1530a02b0766cccc45ef2e8
Related Items (59)
Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers ⋮ A simple competitive graph coloring algorithm. III ⋮ Chromatic numbers of exact distance graphs ⋮ Unnamed Item ⋮ Asymmetric coloring games on incomparability graphs ⋮ On coloring numbers of graph powers ⋮ Generalised game colouring of graphs ⋮ The relaxed game chromatic index of \(k\)-degenerate graphs ⋮ Game chromatic index ofk-degenerate graphs ⋮ The relaxed edge-coloring game and \(k\)-degenerate graphs ⋮ Game-perfect digraphs ⋮ Game chromatic number of graphs with locally bounded number of cycles ⋮ Coloring games on squares of graphs ⋮ A connected version of the graph coloring game ⋮ Adapted game colouring of graphs ⋮ Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs ⋮ The game chromatic number and the game colouring number of classes of oriented cactuses ⋮ The strong game colouring number of directed graphs ⋮ Note on the game colouring number of powers of graphs ⋮ A note on the connected game coloring number ⋮ The game chromatic index of wheels ⋮ The game Grundy number of graphs ⋮ The game \(L(d,1)\)-labeling problem of graphs ⋮ A simple competitive graph coloring algorithm. II. ⋮ Activation strategy for asymmetric marking games ⋮ Uniform orderings for generalized coloring numbers ⋮ Indicated coloring of matroids ⋮ A note on the game chromatic index of graphs ⋮ Efficient Graph Packing via Game Colouring ⋮ Refined activation strategy for the marking game ⋮ The game Grundy indices of graphs ⋮ On the weak 2-coloring number of planar graphs ⋮ The game coloring number of planar graphs with a specific girth ⋮ On the generalised colouring numbers of graphs that exclude a fixed minor ⋮ The game of arboricity ⋮ The incidence game chromatic number ⋮ Complete multipartite graphs and the relaxed coloring game ⋮ The incidence game chromatic number of paths and subgraphs of wheels ⋮ Weak acyclic coloring and asymmetric coloring games ⋮ Very asymmetric marking games ⋮ The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\) ⋮ The game coloring number of planar graphs with a given girth ⋮ The incidence game chromatic number of \((a,d)\)-decomposable graphs ⋮ Autotopism stabilized colouring games on rook's graphs ⋮ Game coloring the Cartesian product of graphs ⋮ Colouring games based on autotopisms of Latin hyper-rectangles ⋮ The 6-relaxed game chromatic number of outerplanar graphs ⋮ On the relaxed colouring game and the unilateral colouring game ⋮ Relaxed very asymmetric coloring games ⋮ Game-perfect graphs ⋮ Lightness of digraphs in surfaces and directed game chromatic number ⋮ Colouring games on outerplanar graphs and trees ⋮ Activation strategy for relaxed asymmetric coloring games ⋮ Relaxed game chromatic number of trees and outerplanar graphs ⋮ Generalization of transitive fraternal augmentations for directed graphs and its applications ⋮ Colouring graphs with bounded generalized colouring number ⋮ On the game chromatic number of splitting graphs of path and cycle ⋮ Marking Games ⋮ Uniquely colorable graphs with equal chromatic and game chromatic numbers
Cites Work
This page was built for publication: A simple competitive graph coloring algorithm
