Get started
Author

Stephen Finbow

Observed names: Finbow, S., Finbow, Stephen, S. Finbow
ORCID: 0000-0001-7984-0245
Observed ORCID: 0000-0001-7984-0245
OpenAlex ID: A5087436773
The firefighter problem for graphs of maximum degree three
2006 · Stephen Finbow, Andrew King, et al. · Discrete Mathematics · 112
PDF
The Firefighter Problem: a survey of results, directions and questions.
2009 · Stephen Finbow, Gary MacGillivray · 108
The surviving rate of an infected network
2010 · Weifan Wang, Stephen Finbow, et al. · Theoretical Computer Science · 31
PDF
A lower bound of the surviving rate of a planar graph with girth at least seven
2012 · Weifan Wang, Stephen Finbow, et al. · Journal of Combinatorial Optimization · 15
Cops that surround a robber
2020 · Andrea C. Burgess, Rosalind A. Cameron, et al. · Discrete Applied Mathematics · 13
The Robber Strikes Back
2013 · Anthony Bonato, Stephen Finbow, et al. · Advances in intelligent systems and computing · 10
A note on the eternal dominating set problem
2018 · Stephen Finbow, Serge Gaspers, et al. · International Journal of Game Theory · 8
Seepage in directed acyclic graphs.
2009 · Nancy E. Clarke, Stephen Finbow, et al. · Australas. J Comb. · 8
Eternal domination on 3 × n grid graphs
2015 · Stephen Finbow, Margaret-Ellen Messinger, et al. · Australas. J Comb. · 7
A simple method of computing the catch time
2013 · Nancy E. Clarke, Stephen Finbow, et al. · Ars Mathematica Contemporanea · 7
PDF
The 2-surviving rate of planar graphs without 6-cycles
2013 · Weifan Wang, Stephen Finbow, et al. · Theoretical Computer Science · 7
PDF
The robber strikes back
2013 · Bonato, Anthony, Finbow, Stephen, et al. · arXiv (Cornell University) · 6
PDF
Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles
2020 · Danjun Huang, Xiaoxiu Zhang, et al. · Discrete Mathematics Algorithms and Applications · 5
Triangulations and equality in the domination chain
2015 · Stephen Finbow, Christopher M. van Bommel · Discrete Applied Mathematics · 5
PDF
Generalisations of irredundance in graphs
2003 · Stephen Finbow · UVic’s Research and Learning Repository (University of Victoria) · 5
On the vertex partition of planar graphs into forests with bounded degree
2020 · Yang Wang, Danjun Huang, et al. · Applied Mathematics and Computation · 4
Hyperopic Cops and Robbers
2018 · A. Bonato, N.E. Clarke, et al. · Theoretical Computer Science · 4
An improved bound on parity vertex colourings of outerplane graphs
2012 · Weifan Wang, Stephen Finbow, et al. · Discrete Mathematics · 4
Open irredundance and maximum degree in graphs
2008 · E.J. Cockayne, O. Favaron, et al. · Discrete Mathematics · 4
A note on the Grundy number and graph products
2015 · Nancy E. Clarke, Stephen Finbow, et al. · Discrete Applied Mathematics · 2
Acyclic Chromatic Index of 1-Planar Graphs
2022 · Wanshun Yang, Yiqiao Wang, et al. · Mathematics · 1
PDF
List backbone colouring of graphs
2013 · Yuehua Bu, Stephen Finbow, et al. · Discrete Applied Mathematics · 1
A note on bounds for the cop number using tree decompositions
2013 · Bonato, Anthony, Clarke, N. E., et al. · arXiv (Cornell University) · 1
PDF
Even time constraints on the watchman's walk.
2013 · Iain Beaton, Rory Begin, et al. · Australas. J Comb. · 1
A lower bound for the CO-irredundance number of a graph
2005 · S. Finbow · Discrete Mathematics · 1
Works count: 40
Citation count: 370
H-index: 8
I10-index: 6
Year
Topic
Type