The following pages link to William B. Kinnersley (Q265088):
Displaying 24 items.
- To catch a falling robber (Q265090) (← links)
- Game brush number (Q290091) (← links)
- Lazy cops and robbers played on random graphs and graphs on surfaces (Q344444) (← links)
- Multicolor on-line degree Ramsey numbers of trees (Q353401) (← links)
- A note on the acquaintance time of random graphs (Q396895) (← links)
- On-line Ramsey theory for bounded degree graphs (Q551227) (← links)
- Bounds on the length of a game of cops and robbers (Q724868) (← links)
- (Q1953496) (redirect page) (← links)
- New results in \(t\)-tone coloring of graphs (Q1953497) (← links)
- Cops, robbers, and burning bridges (Q2041705) (← links)
- Rainbow spanning trees in abelian groups (Q2159386) (← links)
- Catching an infinitely fast robber on a grid (Q2166261) (← links)
- Cops and robbers is EXPTIME-complete (Q2259861) (← links)
- Chain-making games in grid-like posets (Q2375851) (← links)
- Game matching number of graphs (Q2446826) (← links)
- Degree Ramsey Numbers of Graphs (Q2883865) (← links)
- Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two (Q3462542) (← links)
- Bounds on the localization number (Q5066905) (← links)
- Fully Active Cops and Robbers (Q5109068) (← links)
- Toppling numbers of complete and random graphs (Q5173157) (← links)
- The Game Saturation Number of a Graph (Q5272930) (← links)
- Lazy Cops and Robbers on Hypercubes (Q5364259) (← links)
- Extremal Problems for Game Domination Number (Q5408611) (← links)
- (Q5413467) (← links)
