Pages that link to "Item:Q5454360"
From MaRDI portal
The following pages link to The game chromatic number of random graphs (Q5454360):
Displaying 20 items.
- The game chromatic number of dense random graphs (Q490261) (← links)
- The incidence game chromatic number of paths and subgraphs of wheels (Q534326) (← links)
- Game chromatic index of graphs with given restrictions on degrees (Q954995) (← links)
- Majority coloring game (Q1727720) (← links)
- A new upper bound on the game chromatic index of graphs (Q1753125) (← links)
- Indicated coloring of graphs (Q1761467) (← links)
- Game-perfect digraphs (Q1935960) (← links)
- The eternal game chromatic number of random graphs (Q2033931) (← 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)
- The difference between game chromatic number and chromatic number of graphs (Q2274521) (← links)
- The connected greedy coloring game (Q2699943) (← links)
- On the game chromatic number of sparse random graphs (Q2848537) (← links)
- Hypergraph games and the chromatic number (Q3348935) (← links)
- (Q3404778) (← links)
- (Q5148704) (← links)
- On indicated coloring of some classes of graphs (Q5919702) (← 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)