A simple competitive graph coloring algorithm. III

DOI10.1016/J.JCTB.2004.03.010zbMATH Open1056.05056OpenAlexW2083586321MaRDI QIDQ1880795FDOQ1880795

Authors: Charles Dunn, H. A. Kierstead 

Publication date: 1 October 2004

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2004.03.010

Recommendations

• A simple competitive graph coloring algorithm. II.
• The Map-Coloring Game
• Radius two trees specify χ‐bounded classes
• The game coloring number of planar graphs
• scientific article; zbMATH DE number 139777

zbMATH Keywords

winning strategyplayer

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Games involving graphs (91A43)

Cites Work

• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• A bound for the game chromatic number of graphs
• Title not available (Why is that?)
• Game chromatic number of outerplanar graphs
• Competitive colorings of oriented graphs
• On the oriented game chromatic number
• The game coloring number of planar graphs
• A simple competitive graph coloring algorithm
• The game coloring number of pseudo partial \(k\)-trees
• Radius two trees specify χ‐bounded classes
• Edge-partitions of planar graphs and their game coloring numbers
• Title not available (Why is that?)
• A simple competitive graph coloring algorithm. II.
• The relaxed game chromatic number of outerplanar graphs

Cited In (33)

• Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers
• Title not available (Why is that?)
• The game of arboricity
• Relaxed very asymmetric coloring games
• The topology of competitively constructed graphs
• Generalised game colouring of graphs
• The game coloring number of planar graphs with a specific girth
• Proper colouring painter-builder game
• Game-perfect graphs
• Activation strategy for relaxed asymmetric coloring games
• Colouring games on outerplanar graphs and trees
• The Map-Coloring Game
• Defective 3-paintability of planar graphs
• Introduction to competitive graph coloring
• Radius two trees specify χ‐bounded classes
• The relaxed edge-coloring game and \(k\)-degenerate graphs
• The relaxed game chromatic number of graphs with cut-vertices
• The game \(L(d,1)\)-labeling problem of graphs
• On the relaxed colouring game and the unilateral colouring game
• The relaxed game chromatic index of \(k\)-degenerate graphs
• The 6-relaxed game chromatic number of outerplanar graphs
• The game of arboricity
• Game list colouring of graphs
• A simple competitive graph coloring algorithm. II.
• Activation strategy for asymmetric marking games
• Game-perfect digraphs
• A simple competitive graph coloring algorithm
• Complete multipartite graphs and the relaxed coloring game
• Title not available (Why is that?)
• The game Grundy number of graphs
• Game coloring the Cartesian product of graphs
• Game chromatic number of some network graphs
• Refined activation strategy for the marking game

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

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