The following pages link to S. L. Fitzpatrick (Q215015):
Displaying 22 items.
- A deterministic version of the game of zombies and survivors on graphs (Q313777) (← links)
- The game of Cops and Robber on circulant graphs (Q528556) (← links)
- (Q708373) (redirect page) (← links)
- Edge critical cops and robber (Q708375) (← links)
- Well paired-dominated graphs (Q711404) (← links)
- (Q1613534) (redirect page) (← links)
- Total domination in complements of graphs containing no \(K _{4,4}\) (Q1613536) (← links)
- Distributive online channel assignment for hexagonal cellular networks with constraints (Q1887044) (← links)
- Edge-critical cops and robber in planar graphs (Q2017039) (← links)
- The isometric path number of a graph (Q2747184) (← links)
- (Q3451441) (← links)
- (Q3614018) (← links)
- Paired-domination (Q4222381) (← links)
- The strong isometric dimension of finite reflexive graphs (Q4522458) (← links)
- (Q4949797) (← links)
- Lower Bounds from Tile Covers for the Channel Assignment Problem (Q5317580) (← links)
- (Q5460876) (← links)
- (Q5487922) (← links)
- (Q5492576) (← links)
- A note on bounds for the cop number using tree decompositions (Q5499967) (← links)
- Covering hypercubes by isometric paths (Q5948983) (← links)
- A note on the Grundy number and graph products (Q5962510) (← links)
