Pages that link to "Item:Q2464148"

The following pages link to Refined activation strategy for the marking game (Q2464148):

Displaying 50 items.

• Asymmetric coloring games on incomparability graphs (Q324375) (← links)
• Game chromatic number of graphs with locally bounded number of cycles (Q407532) (← links)
• Coloring games on squares of graphs (Q408174) (← links)
• Adapted game colouring of graphs (Q412230) (← links)
• The game Grundy indices of graphs (Q498433) (← 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)
• Decomposing a graph into forests (Q765188) (← links)
• The game chromatic number and the game colouring number of cactuses (Q845991) (← links)
• Note on the game colouring number of powers of graphs (Q907829) (← links)
• Activation strategy for asymmetric marking games (Q925014) (← 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)
• Activation strategy for relaxed asymmetric coloring games (Q1025957) (← links)
• Circular game chromatic number of graphs (Q1043981) (← links)
• Game colouring of the square of graphs (Q1043984) (← links)
• Chromatic numbers of exact distance graphs (Q1633747) (← 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)
• The median game (Q1751121) (← links)
• A new upper bound on the game chromatic index of graphs (Q1753125) (← links)
• Game-perfect digraphs (Q1935960) (← links)
• The game chromatic number and the game colouring number of classes of oriented cactuses (Q1944077) (← links)
• The strong game colouring number of directed graphs (Q1945951) (← 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)
• \textsf{PSPACE}-hardness of variants of the graph coloring game (Q2078618) (← links)
• Game chromatic number of strong product graphs (Q2092388) (← links)
• PSPACE-hardness of two graph coloring games (Q2132363) (← links)
• PSPACE-completeness of two graph coloring games (Q2182325) (← links)
• A connected version of the graph coloring game (Q2192130) (← links)
• Uniform orderings for generalized coloring numbers (Q2225419) (← links)
• The difference between game chromatic number and chromatic number of graphs (Q2274521) (← links)
• On the game chromatic number of splitting graphs of path and cycle (Q2330094) (← links)
• The orthogonal colouring game (Q2330119) (← links)
• Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs (Q2427530) (← links)
• Weak acyclic coloring and asymmetric coloring games (Q2488942) (← links)
• Very asymmetric marking games (Q2490427) (← links)
• On a vertex-edge marking game on graphs (Q2660140) (← links)
• The complexity of two colouring games (Q2696280) (← links)
• The connected greedy coloring game (Q2699943) (← links)
• A note on the connected game coloring number (Q2700603) (← links)
• Efficient Graph Packing via Game Colouring (Q3552503) (← links)