Colouring games
From MaRDI portal
Publication:2822601
zbMATH Open1356.05090MaRDI QIDQ2822601FDOQ2822601
Authors: Zsolt Tuza, Xuding Zhu 
Publication date: 30 September 2016
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)
Cited In (22)
- On game chromatic vertex-critical graphs
- Transversal game on hypergraphs and the \(\frac{3}{4}\)-conjecture on the total domination game
- Indicated coloring game on Cartesian products of graphs
- Relaxed very asymmetric coloring games
- Title not available (Why is that?)
- The cordiality game and the game cordiality number
- Infinite chromatic games
- Game-perfect semiorientations of forests
- The orthogonal colouring game
- Autotopism stabilized colouring games on rook's graphs
- Graph colorings with restricted bicolored subgraphs: II. The graph coloring game
- Bounds on the game transversal number in hypergraphs
- Mr. Paint and Mrs. Correct
- Graph labeling games
- Grundy coloring in some subclasses of bipartite graphs and their complements
- Domination game on uniform hypergraphs
- A note on the connected game coloring number
- Title not available (Why is that?)
- Impartial coloring games
- Results on the graceful game and range-relaxed graceful game
- The coloring game on matroids
- Indicated domination game
This page was built for publication: Colouring games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2822601)
