Pages that link to "Item:Q845991"

The following pages link to The game chromatic number and the game colouring number of cactuses (Q845991):

Displaying 15 items.

• The graph distance game and some graph operations (Q283692) (← links)
• Game chromatic number of graphs with locally bounded number of cycles (Q407532) (← links)
• The coloring game on planar graphs with large girth, by a result on sparse cactuses (Q512597) (← links)
• Game-perfect digraphs (Q1935960) (← links)
• The game chromatic number and the game colouring number of classes of oriented cactuses (Q1944077) (← links)
• The eternal game chromatic number of random graphs (Q2033931) (← 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)
• PSPACE-completeness of two graph coloring games (Q2182325) (← links)
• On a vertex-edge marking game on graphs (Q2660140) (← links)
• The complexity of two colouring games (Q2696280) (← links)
• (Q3303537) (← 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)