| Publication | Date of Publication | Type |
|---|
The speed and threshold of the biased Hamilton cycle game
Procedia Computer Science | 2025-12-02 | Paper |
The speed and threshold of the biased perfect matching game
Procedia Computer Science | 2025-12-02 | Paper |
Fractional eternal domination: securely distributing resources across a network
Discussiones Mathematicae. Graph Theory | 2025-05-12 | Paper |
Defective acyclic colorings of planar graphs
Journal of Graph Theory | 2025-01-06 | Paper |
Few Hamiltonian cycles in graphs with one or two vertex degrees
Mathematics of Computation | 2024-08-21 | Paper |
Edge clique covers in graphs with independence number two
Journal of Graph Theory | 2023-09-29 | Paper |
Further results on Hendry's Conjecture
Discrete Mathematics & Theoretical Computer Science | 2023-05-31 | Paper |
| Fractional eternal domination: securely distributing resources across a network | 2023-04-23 | Paper |
| Defective acyclic colorings of planar graphs | 2023-01-27 | Paper |
| Few hamiltonian cycles in graphs with one or two vertex degrees | 2022-11-15 | Paper |
| The Speed and Threshold of the Biased Perfect Matching Game | 2020-12-08 | Paper |
| The Speed and Threshold of the Biased Hamilton Cycle Game | 2020-12-08 | Paper |
A method for eternally dominating strong grids
(available as arXiv preprint) | 2020-10-28 | Paper |
Eternal domination on prisms of graphs
Discrete Applied Mathematics | 2020-06-29 | Paper |
| Fully active cops and robbers | 2020-05-07 | Paper |
Fully active cops and robbers
(available as arXiv preprint) | 2020-05-07 | Paper |
| A study of cops and robbers in oriented graphs | 2018-11-14 | Paper |
Hamiltonian chordal graphs are not cycle extendable
SIAM Journal on Discrete Mathematics | 2015-06-08 | Paper |
On uniquely Hamiltonian claw-free and triangle-free graphs
Discussiones Mathematicae Graph Theory | 2015-05-11 | Paper |
Bounding the monomial index and (1,l)-weight choosability of a graph
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2014-11-10 | Paper |
Bounding the monomial index and (1,l)-weight choosability of a graph
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2014-11-10 | Paper |
| Vertex-colouring edge-weightings with two edge weights | 2014-03-25 | Paper |
Sequence variations of the 1-2-3 conjecture and irregularity strength
(available as arXiv preprint) | 2014-02-14 | Paper |
| Sequence variations of the 1-2-3 conjecture and irregularity strength | 2014-02-14 | Paper |
\(\pi /2\)-angle Xao graphs are spanners
International Journal of Computational Geometry & Applications | 2012-11-23 | Paper |
| The 1-2-3 Conjecture and related problems: a survey | 2012-11-21 | Paper |
Spanning trees with specified differences in Cayley graphs
Discrete Mathematics | 2012-08-10 | Paper |
Digraphs are 2-weight choosable
The Electronic Journal of Combinatorics | 2011-02-17 | Paper |
Digraphs are 2-weight choosable
The Electronic Journal of Combinatorics | 2011-02-17 | Paper |
π/2-Angle Yao Graphs Are Spanners
Algorithms and Computation | 2010-12-09 | Paper |
Independent dominating sets and hamiltonian cycles
Journal of Graph Theory | 2007-03-20 | Paper |
