Pages that link to "Item:Q1743687"

The following pages link to The game coloring number of planar graphs with a specific girth (Q1743687):

Displaying 10 items.

• The coloring game on planar graphs with large girth, by a result on sparse cactuses (Q512597) (← links)
• Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers (Q819816) (← links)
• The game coloring number of planar graphs with a given girth (Q2017053) (← links)
• \textsf{PSPACE}-hardness of variants of the graph coloring game (Q2078618) (← links)
• PSPACE-hardness of two graph coloring games (Q2132363) (← 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)
• Edge-partitions of planar graphs and their game coloring numbers (Q4798121) (← links)
• On monotonicity in maker-breaker graph colouring games (Q6202940) (← links)
• On graphs with maximum difference between game chromatic number and chromatic number (Q6646398) (← links)