A simple competitive graph coloring algorithm

DOI10.1006/JCTB.1999.1927MaRDI QIDQ1569067zbMATH OpenOpenAlexFDO

Authors H. A. Kierstead

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

zbMATH Keywords

game coloring numberorientable surfacesplanar graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• The game coloring number of planar graphs
• scientific article; zbMATH DE number 398953
• Radius two trees specify χ‐bounded classes
• A simple competitive graph coloring algorithm. III
• scientific article; zbMATH DE number 431513

Cites work

• A bound for the game chromatic number of graphs
• Game chromatic number of outerplanar graphs
• scientific article; zbMATH DE number 139777 (Why is no real title available?)
• scientific article; zbMATH DE number 398953 (Why is no real title available?)
• Radius two trees specify χ‐bounded classes
• The game coloring number of planar graphs

Cited in

(62)

• 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
• Generalization of transitive fraternal augmentations for directed graphs and its applications
• Colouring graphs with bounded generalized colouring number
• A simple competitive graph coloring algorithm. II.
• Chromatic numbers of exact distance graphs
• The game coloring number of planar graphs with a specific girth
• Complete multipartite graphs and the relaxed coloring game
• Relaxed game chromatic number of trees and outerplanar graphs
• A simple competitive graph coloring algorithm. III
• Game-perfect digraphs
• The game chromatic number and the game colouring number of classes of oriented cactuses
• The strong game colouring number of directed graphs
• The game Grundy number of graphs
• 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
• On coloring numbers of graph powers
• A connected version of the graph coloring game
• Uniform orderings for generalized coloring numbers
• On the weak 2-coloring number of planar graphs
• On the game chromatic number of splitting graphs of path and cycle
• Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
• Refined activation strategy for the marking game
• The game of arboricity
• Weak acyclic coloring and asymmetric coloring games
• Very asymmetric marking games
• The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
• A note on the connected game coloring number
• Game chromatic index of \(k\)-degenerate graphs
• scientific article; zbMATH DE number 431513 (Why is no real title available?)
• Equality perfect graphs and digraphs
• Marking Games
• Efficient graph packing via game colouring
• A Game Theoretic Approach for Efficient Graph Coloring
• Game coloring the Cartesian product of graphs
• Game chromatic number of graphs with locally bounded number of cycles
• Coloring games on squares of graphs
• Adapted game colouring of graphs
• The game \(L(d,1)\)-labeling problem of graphs
• Indicated coloring of matroids
• The game Grundy indices of graphs
• Colouring games based on autotopisms of Latin hyper-rectangles
• The incidence game chromatic number of paths and subgraphs of wheels
• Uniquely colorable graphs with equal chromatic and game chromatic numbers
• The incidence game chromatic number
• On the generalised colouring numbers of graphs that exclude a fixed minor
• The game chromatic index of wheels
• Introduction to competitive graph coloring
• The r-dynamic chromatic number is bounded in the strong 2-coloring number
• On the relaxed colouring game and the unilateral colouring game
• Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers
• Generalised game colouring of graphs
• The relaxed game chromatic index of k-degenerate graphs
• The relaxed edge-coloring game and \(k\)-degenerate graphs
• Note on the game colouring number of powers of graphs
• Activation strategy for asymmetric marking games
• A note on the game chromatic index of graphs
• The 6-relaxed game chromatic number of outerplanar graphs

This page was built for publication: A simple competitive graph coloring algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569067)