Pages that link to "Item:Q3988839"

The following pages link to ON THE COMPLEXITY OF SOME COLORING GAMES (Q3988839):

Displaying 48 items.

• On game chromatic vertex-critical graphs (Q2107136) (← links)
• Game-perfect semiorientations of forests (Q2118241) (← links)
• PSPACE-completeness of two graph coloring games (Q2182325) (← links)
• A connected version of the graph coloring game (Q2192130) (← links)
• Game chromatic number of some network graphs (Q2195643) (← links)
• Game connectivity of graphs (Q2198411) (← links)
• Indicated coloring game on Cartesian products of graphs (Q2217485) (← links)
• The difference between game chromatic number and chromatic number of graphs (Q2274521) (← links)
• Online coloring a token graph (Q2303438) (← links)
• The orthogonal colouring game (Q2330119) (← links)
• Proper 2-coloring game on some trees (Q2420567) (← links)
• The edge coloring game on trees with the number of colors greater than the game chromatic index (Q2424821) (← links)
• Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs (Q2427530) (← links)
• Refined activation strategy for the marking game (Q2464148) (← links)
• The game of arboricity (Q2476280) (← links)
• Weak acyclic coloring and asymmetric coloring games (Q2488942) (← links)
• The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\) (Q2492207) (← links)
• On a vertex-edge marking game on graphs (Q2660140) (← links)
• The complexity of two colouring games (Q2696280) (← links)
• A note on the connected game coloring number (Q2700603) (← links)
• Game chromatic index of \(k\)-degenerate graphs (Q2712591) (← links)
• The Parallel Complexity of Coloring Games (Q2819445) (← links)
• Transversal game on hypergraphs and the \(\frac{3}{4}\)-conjecture on the total domination game (Q2821619) (← links)
• Colouring games (Q2822601) (← links)
• Deciding the On-line Chromatic Number of a Graph with Pre-coloring Is PSPACE-Complete (Q2947029) (← links)
• (Q3303537) (← links)
• Game-perfect Graphs with Clique Number 2 (Q3439456) (← links)
• Efficient Graph Packing via Game Colouring (Q3552503) (← links)
• Game coloring the Cartesian product of graphs (Q3605153) (← links)
• Game chromatic number of outerplanar graphs (Q4256107) (← links)
• The independence coloring game on graphs (Q5048907) (← links)
• On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs (Q5154626) (← links)
• Colouring games based on autotopisms of Latin hyper-rectangles (Q5198043) (← links)
• (Q5241174) (← links)
• Paired-Domination Game Played in Graphs (Q5242939) (← links)
• Uniquely colorable graphs with equal chromatic and game chromatic numbers (Q5866017) (← links)
• Vertex-edge marking score of certain triangular lattices (Q5869451) (← links)
• Game chromatic number of toroidal grids (Q5891223) (← links)
• The incidence game chromatic number (Q5899386) (← links)
• Game chromatic number of toroidal grids (Q5901168) (← links)
• The incidence game chromatic number (Q5902114) (← links)
• Seurat games on Stockmeyer graphs (Q6056811) (← links)
• Graph colorings with restricted bicolored subgraphs: II. The graph coloring game (Q6081568) (← links)
• Abstract colorings, games and ultrafilters (Q6098399) (← links)
• The complexity of grid coloring (Q6109067) (← links)
• On monotonicity in maker-breaker graph colouring games (Q6202940) (← links)
• Indicated domination game (Q6553169) (← links)
• On graphs with maximum difference between game chromatic number and chromatic number (Q6646398) (← links)