ON THE COMPLEXITY OF SOME COLORING GAMES

From MaRDI portal
Publication:3988839

DOI10.1142/S0129054191000091zbMath0753.05061OpenAlexW1988939889MaRDI QIDQ3988839

Hans L. Bodlaender

Publication date: 28 June 1992

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054191000091




Related Items

Edge-partitions of graphs of nonnegative characteristic and their game coloring numbersThe independence coloring game on graphsThe complexity of constraint satisfaction games and QCSPUnnamed ItemComplexity of the game domination problemThe game chromatic number and the game colouring number of cactusesAsymmetric coloring games on incomparability graphsBounds on the game transversal number in hypergraphsPaired-Domination Game Played in GraphsVertex-edge marking score of certain triangular latticesOn a vertex-edge marking game on graphsGeneralised game colouring of graphsProblems on cycles and coloringsGame chromatic index ofk-degenerate graphsUnnamed ItemImpartial coloring gamesDeciding the On-line Chromatic Number of a Graph with Pre-coloring Is PSPACE-CompleteGame-perfect digraphsGraph colorings with restricted bicolored subgraphs: II. The graph coloring gameGame chromatic number of graphs with locally bounded number of cyclesA connected version of the graph coloring gameOn the game coloring index of \(F^+\)-decomposable graphsThe edge coloring game on trees with the number of colors greater than the game chromatic indexGame chromatic number of some network graphsLower bounds for the game colouring number of partial \(k\)-trees and planar graphsGame connectivity of graphsThe game chromatic number and the game colouring number of classes of oriented cactusesOn monotonicity in maker-breaker graph colouring gamesThe matcher game played in graphsNote on the game colouring number of powers of graphsThe complexity of two colouring gamesA note on the connected game coloring numberThe game chromatic index of wheelsThe game Grundy number of graphsIndicated coloring game on Cartesian products of graphsMajority coloring gameIndicated coloring of matroidsOn Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbersA note on the game chromatic index of graphsEfficient Graph Packing via Game ColouringGame chromatic number of toroidal gridsRefined activation strategy for the marking gameThe game Grundy indices of graphsThe game coloring number of planar graphs with a specific girthOn kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphsThe coloring game on matroidsThe coloring game on planar graphs with large girth, by a result on sparse cactusesThe incidence game chromatic numberGame chromatic number of toroidal gridsThe game of arboricityThe incidence game chromatic numberThe complexity of coloring games on perfect graphsThe incidence game chromatic number of paths and subgraphs of wheelsIndicated coloring of graphsDirected defective asymmetric graph coloring gamesDecomposition of sparse graphs, with application to game coloring numberComplexity of path-forming gamesWeak acyclic coloring and asymmetric coloring gamesThe game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)The game coloring number of planar graphs with a given girthThe incidence game chromatic number of \((a,d)\)-decomposable graphsThe difference between game chromatic number and chromatic number of graphsAutotopism stabilized colouring games on rook's graphsGame coloring the Cartesian product of graphsColouring games based on autotopisms of Latin hyper-rectanglesOnline chromatic number is PSPACE-completeAutoparatopism stabilized colouring games on rook's graphsThe 6-relaxed game chromatic number of outerplanar graphsGame chromatic number of outerplanar graphsOn the relaxed colouring game and the unilateral colouring gameGame-perfect graphsTransversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination GameLightness of digraphs in surfaces and directed game chromatic numberColouring games on outerplanar graphs and treesDecomposing a graph into forestsRelaxed game chromatic number of trees and outerplanar graphsCircular game chromatic number of graphsAsymmetric directed graph coloring gamesThe orthogonal colouring gameGame chromatic number of strong product graphsThe game coloring number of planar graphsGame-perfect Graphs with Clique Number 2Uniquely colorable graphs with equal chromatic and game chromatic numbersOn game chromatic vertex-critical graphsGame-perfect semiorientations of forests