Pages that link to "Item:Q1297403"
From MaRDI portal
The following pages link to A bound for the game chromatic number of graphs (Q1297403):
Displaying 15 items.
- (Q3404778) (← 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 outerplanar graphs (Q4256107) (← links)
- Radius two trees specify χ‐bounded classes (Q4309985) (← links)
- (Q4604093) (← links)
- The Game Saturation Number of a Graph (Q5272930) (← links)
- (Q5310233) (← links)
- The game chromatic number of random graphs (Q5454360) (← 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)
- Introduction to competitive graph coloring (Q6599238) (← links)
- On graphs with maximum difference between game chromatic number and chromatic number (Q6646398) (← links)