Directed defective asymmetric graph coloring games
DOI10.1016/J.DAM.2009.04.025zbMATH Open1226.05114OpenAlexW1987349754MaRDI QIDQ968138FDOQ968138
Authors: Stephan Dominique Andres
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.04.025
Recommendations
defectdichromatic numbergame chromatic numberrelaxed coloringasymmetric coloringdigraph coloring gamedirected forest
Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- The dichromatic number of a digraph
- Title not available (Why is that?)
- On the oriented game chromatic number
- ON THE COMPLEXITY OF SOME COLORING GAMES
- The game coloring number of planar graphs
- Refined activation strategy for the marking game
- Asymmetric graph coloring games
- Relaxed game chromatic number of graphs
- Lightness of digraphs in surfaces and directed game chromatic number
- Relaxed game chromatic number of trees and outerplanar graphs
- Asymmetric directed graph coloring games
Cited In (4)
This page was built for publication: Directed defective asymmetric graph coloring games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968138)