Pages that link to "Item:Q2427530"

The following pages link to Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs (Q2427530):

Displaying 23 items.

• Asymmetric coloring games on incomparability graphs (Q324375) (← links)
• The game chromatic index of wheels (Q643001) (← links)
• Note on the game colouring number of powers of graphs (Q907829) (← links)
• Activation strategy for relaxed asymmetric coloring games (Q1025957) (← links)
• Circular game chromatic number of graphs (Q1043981) (← links)
• The game coloring number of planar graphs with a specific girth (Q1743687) (← 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)
• The incidence game chromatic number of \((a,d)\)-decomposable graphs (Q2018537) (← links)
• On indicated coloring of lexicographic product of graphs (Q2161277) (← links)
• A connected version of the graph coloring game (Q2192130) (← links)
• Refined activation strategy for the marking game (Q2464148) (← links)
• Very asymmetric marking games (Q2490427) (← links)
• A note on the connected game coloring number (Q2700603) (← links)
• (Q3303537) (← 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)
• On indicated coloring of some classes of graphs (Q5919702) (← 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)