Pages that link to "Item:Q1297403"

The following pages link to A bound for the game chromatic number of graphs (Q1297403):

Displaying 50 items.

• The graph distance game and some graph operations (Q283692) (← links)
• Game brush number (Q290091) (← links)
• Asymmetric coloring games on incomparability graphs (Q324375) (← links)
• Bounds on the game transversal number in hypergraphs (Q326647) (← links)
• Impartial coloring games (Q388789) (← links)
• The game \(L(d,1)\)-labeling problem of graphs (Q456896) (← links)
• Indicated coloring of matroids (Q477356) (← links)
• The game Grundy indices of graphs (Q498433) (← links)
• The incidence game chromatic number of paths and subgraphs of wheels (Q534326) (← links)
• The game chromatic index of wheels (Q643001) (← links)
• Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers (Q819816) (← links)
• Generalised game colouring of graphs (Q878606) (← links)
• The relaxed game chromatic index of \(k\)-degenerate graphs (Q879391) (← links)
• The relaxed edge-coloring game and \(k\)-degenerate graphs (Q890010) (← links)
• An upper bound on the extremal version of Hajnal's triangle-free game (Q897581) (← links)
• Note on the game colouring number of powers of graphs (Q907829) (← links)
• On forbidden subdivision characterizations of graph classes (Q925035) (← links)
• The 6-relaxed game chromatic number of outerplanar graphs (Q998330) (← 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)
• The game coloring number of planar graphs (Q1305532) (← links)
• A simple competitive graph coloring algorithm. II. (Q1425110) (← links)
• A simple competitive graph coloring algorithm (Q1569067) (← links)
• Complete multipartite graphs and the relaxed coloring game (Q1757865) (← links)
• A simple competitive graph coloring algorithm. III (Q1880795) (← links)
• The strong game colouring number of directed graphs (Q1945951) (← links)
• The incidence game chromatic number of \((a,d)\)-decomposable graphs (Q2018537) (← links)
• The eternal game chromatic number of random graphs (Q2033931) (← links)
• \textsf{PSPACE}-hardness of variants of the graph coloring game (Q2078618) (← links)
• On game chromatic vertex-critical graphs (Q2107136) (← 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)
• Indicated coloring game on Cartesian products of graphs (Q2217485) (← links)
• On the game chromatic number of splitting graphs of path and cycle (Q2330094) (← links)
• Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs (Q2427530) (← links)
• The game chromatic index of some trees of maximum degree 4 (Q2449078) (← 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)
• A note on the connected game coloring number (Q2700603) (← links)
• Game chromatic index ofk-degenerate graphs (Q2712591) (← links)
• Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two (Q3462542) (← links)
• Efficient Graph Packing via Game Colouring (Q3552503) (← links)
• Game coloring the Cartesian product of graphs (Q3605153) (← links)
• Game chromatic number of Cartesian product graphs (Q5900078) (← links)
• Graph colorings with restricted bicolored subgraphs: II. The graph coloring game (Q6081568) (← links)
• Indicated coloring of the Mycielskian of some families of graphs (Q6174150) (← links)