The following pages link to Stephen Finbow (Q244921):
Displaying 29 items.
- The 2-surviving rate of planar graphs without 6-cycles (Q391779) (← links)
- An improved bound on parity vertex colourings of outerplane graphs (Q449117) (← links)
- Triangulations and equality in the domination chain (Q494427) (← links)
- (Q556835) (redirect page) (← links)
- A lower bound for the CO-irredundance number of a graph (Q556836) (← links)
- The surviving rate of an infected network (Q708218) (← links)
- Open irredundance and maximum degree in graphs (Q998417) (← links)
- A note on the eternal dominating set problem (Q1791289) (← links)
- \(\gamma\)-graphs of trees (Q2005551) (← links)
- A lower bound of the surviving rate of a planar graph with girth at least seven (Q2015802) (← links)
- A short note on the existence of infinite sequences of \(\gamma \)-graphs of graphs (Q2197418) (← links)
- Cops that surround a robber (Q2197471) (← links)
- On the vertex partition of planar graphs into forests with bounded degree (Q2294901) (← links)
- The firefighter problem for graphs of maximum degree three (Q2370449) (← links)
- List backbone colouring of graphs (Q2440098) (← links)
- A simple method of computing the catch time (Q2940090) (← links)
- Advances in finding ideal play on poset games (Q3390718) (← links)
- (Q3581685) (← links)
- (Q3614015) (← links)
- (Q3614018) (← links)
- (Q4504908) (← links)
- Generalised irredundance in graphs: Nordhaus-Gaddum bounds (Q4823302) (← links)
- Advances in finding ideal play on poset games (Q5041705) (← links)
- (Q5109047) (← links)
- (Q5245538) (← links)
- A note on bounds for the cop number using tree decompositions (Q5499967) (← links)
- Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles (Q5858150) (← links)
- A note on the Grundy number and graph products (Q5962510) (← links)
- A note on hyperopic cops and robber (Q6174757) (← links)
