Pages that link to "Item:Q3988839"

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

Displaying 50 items.

• Complexity of the game domination problem (Q313955) (← links)
• Asymmetric coloring games on incomparability graphs (Q324375) (← links)
• Bounds on the game transversal number in hypergraphs (Q326647) (← links)
• Problems on cycles and colorings (Q383772) (← links)
• Impartial coloring games (Q388789) (← links)
• Game chromatic number of graphs with locally bounded number of cycles (Q407532) (← links)
• Indicated coloring of matroids (Q477356) (← links)
• The game Grundy indices of graphs (Q498433) (← links)
• The coloring game on matroids (Q507509) (← links)
• The coloring game on planar graphs with large girth, by a result on sparse cactuses (Q512597) (← links)
• The incidence game chromatic number of paths and subgraphs of wheels (Q534326) (← links)
• The game chromatic index of wheels (Q643001) (← links)
• Online chromatic number is PSPACE-complete (Q726097) (← links)
• On the relaxed colouring game and the unilateral colouring game (Q742610) (← links)
• Decomposing a graph into forests (Q765188) (← links)
• Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers (Q819816) (← links)
• The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
• The game chromatic number and the game colouring number of cactuses (Q845991) (← links)
• Generalised game colouring of graphs (Q878606) (← links)
• Note on the game colouring number of powers of graphs (Q907829) (← links)
• A note on the game chromatic index of graphs (Q937247) (← links)
• Directed defective asymmetric graph coloring games (Q968138) (← links)
• Decomposition of sparse graphs, with application to game coloring number (Q968426) (← links)
• The 6-relaxed game chromatic number of outerplanar graphs (Q998330) (← links)
• Game-perfect graphs (Q1014302) (← links)
• Lightness of digraphs in surfaces and directed game chromatic number (Q1025549) (← links)
• Colouring games on outerplanar graphs and trees (Q1025941) (← links)
• Circular game chromatic number of graphs (Q1043981) (← links)
• Asymmetric directed graph coloring games (Q1045076) (← links)
• The complexity of coloring games on perfect graphs (Q1202928) (← links)
• Complexity of path-forming games (Q1210546) (← links)
• The game coloring number of planar graphs (Q1305532) (← links)
• On the game coloring index of \(F^+\)-decomposable graphs (Q1693133) (← links)
• The matcher game played in graphs (Q1701097) (← links)
• Majority coloring game (Q1727720) (← links)
• On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers (Q1732763) (← links)
• The game coloring number of planar graphs with a specific girth (Q1743687) (← links)
• Indicated coloring of graphs (Q1761467) (← links)
• Autoparatopism stabilized colouring games on rook's graphs (Q1792106) (← links)
• Relaxed game chromatic number of trees and outerplanar graphs (Q1827712) (← links)
• Game-perfect digraphs (Q1935960) (← links)
• The game chromatic number and the game colouring number of classes of oriented cactuses (Q1944077) (← links)
• The game Grundy number of graphs (Q1956234) (← links)
• The game coloring number of planar graphs with a given girth (Q2017053) (← links)
• The incidence game chromatic number of \((a,d)\)-decomposable graphs (Q2018537) (← links)
• Autotopism stabilized colouring games on rook's graphs (Q2026339) (← links)
• Game chromatic number of strong product graphs (Q2092388) (← links)
• On game chromatic vertex-critical graphs (Q2107136) (← links)
• Game-perfect semiorientations of forests (Q2118241) (← links)
• A connected version of the graph coloring game (Q2192130) (← links)