Pages that link to "Item:Q1974537"

The following pages link to The game coloring number of pseudo partial \(k\)-trees (Q1974537):

Displaying 50 items.

• Asymmetric coloring games on incomparability graphs (Q324375) (← links)
• Coloring games on squares of graphs (Q408174) (← links)
• Adapted game colouring of graphs (Q412230) (← links)
• The coloring game on planar graphs with large girth, by a result on sparse cactuses (Q512597) (← links)
• The specification of 2-trees (Q696853) (← links)
• Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers (Q819816) (← links)
• The game chromatic number and the game colouring number of cactuses (Q845991) (← links)
• The relaxed game chromatic index of \(k\)-degenerate graphs (Q879391) (← links)
• The relaxed edge-coloring game and \(k\)-degenerate graphs (Q890010) (← links)
• Note on the game colouring number of powers of graphs (Q907829) (← links)
• Activation strategy for asymmetric marking games (Q925014) (← links)
• The 6-relaxed game chromatic number of outerplanar graphs (Q998330) (← links)
• Relaxed very asymmetric coloring games (Q1011775) (← 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)
• A simple competitive graph coloring algorithm. II. (Q1425110) (← links)
• The game coloring number of planar graphs with a specific girth (Q1743687) (← links)
• Relaxed game chromatic number of trees and outerplanar graphs (Q1827712) (← links)
• A simple competitive graph coloring algorithm. III (Q1880795) (← links)
• Game-perfect digraphs (Q1935960) (← 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)
• Infinite chromatic games (Q2065775) (← links)
• \textsf{PSPACE}-hardness of variants of the graph coloring game (Q2078618) (← links)
• PSPACE-hardness of two graph coloring games (Q2132363) (← links)
• On caterpillars of game chromatic number 4 (Q2132381) (← links)
• PSPACE-completeness of two graph coloring games (Q2182325) (← 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)
• Weak acyclic coloring and asymmetric coloring games (Q2488942) (← links)
• Very asymmetric marking games (Q2490427) (← links)
• On the hat guessing number of a planar graph class (Q2673483) (← links)
• The connected greedy coloring game (Q2699943) (← links)
• A note on the connected game coloring number (Q2700603) (← links)
• Game chromatic index of \(k\)-degenerate graphs (Q2712591) (← links)
• The game colouring number of powers of forests (Q2831883) (← links)
• Efficient Graph Packing via Game Colouring (Q3552503) (← links)
• Game coloring the Cartesian product of graphs (Q3605153) (← links)
• Game chromatic number of toroidal grids (Q5891223) (← links)
• Game chromatic number of Cartesian product graphs (Q5900078) (← links)
• Game chromatic number of toroidal grids (Q5901168) (← links)
• Graph colorings with restricted bicolored subgraphs: II. The graph coloring game (Q6081568) (← links)
• Decomposing planar graphs into graphs with degree restrictions (Q6081583) (← links)
• Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs (Q6108003) (← links)
• On the degree of trees with game chromatic number 4 (Q6140979) (← links)