Follow
Ben Seamone
Ben Seamone
Universite de Montreal & Dawson College
Verified email at iro.umontreal.ca - Homepage
Title
Cited by
Cited by
Year
The 1-2-3 conjecture and related problems: a survey
B Seamone
arXiv preprint arXiv:1211.5122, 2012
115*2012
π/2-Angle Yao graphs are spanners
P Bose, M Damian, K Douieb, J O’Rourke, B Seamone, M Smid, S Wuhrer
Algorithms and Computation, 446-457, 2010
55*2010
Independent dominating sets and Hamiltonian cycles
P Haxell, B Seamone, J Verstraete
Journal of Graph Theory 54 (3), 233-244, 2007
472007
Vertex-colouring edge-weightings with two edge weights
M Khatirinejad, R Naserasr, M Newman, B Seamone, B Stevens
Discrete Mathematics and Theoretical Computer Science 14 (1), 1-20, 2012
312012
Digraphs are 2-weight choosable
M Khatirinejad, R Naserasr, M Newman, B Seamone, B Stevens
Electron. J. Combin 18 (1), 2011
202011
Bounding the monomial index and (1, l)-weight choosability of a graph
B Seamone
Discrete Mathematics & Theoretical Computer Science 16 (3), 173-188, 2014
13*2014
Sequence variations of the 1-2-3 conjecture and irregularity strength
B Seamone, B Stevens
Discrete Mathematics & Theoretical Computer Science 15 (Graph Theory), 2013
112013
Fully active cops and robbers
I Gromovikov, WB Kinnersley, B Seamone
arXiv preprint arXiv:1808.06734, 2018
102018
A study of cops and robbers in oriented graphs
D Khatri, N Komarov, A Krim-Yee, N Kumar, B Seamone, V Virgile, AQ Xu
arXiv preprint arXiv:1811.06155, 2018
92018
Hamiltonian chordal graphs are not cycle extendable
M Lafond, B Seamone
SIAM Journal on Discrete Mathematics 29 (2), 877-887, 2015
92015
Derived colourings of graphs
BD Seamone
Carleton University, 2012
62012
Edge clique covers in graphs with independence number two
P Charbit, G Hahn, M Kamiński, M Lafond, N Lichiardopol, R Naserasr, ...
Journal of graph theory 97 (2), 324-339, 2021
52021
A method for eternally dominating strong grids
A Gagnon, A Hassler, J Huang, A Krim-Yee, F Mc Inerney, A Zacarías, ...
Inria-Sophia Antipolis, 2019
52019
On uniquely Hamiltonian claw-free and triangle-free graphs
B Seamone
Discussiones Mathematicae Graph Theory 35 (2), 207-214, 2015
52015
Spanning trees with specified differences in Cayley graphs
B Seamone, B Stevens
Discrete Mathematics 312 (17), 2561-2565, 2012
32012
Few hamiltonian cycles in graphs with one or two vertex degrees
J Goedgebeur, J Jooken, OHS Lo, B Seamone, C Zamfirescu
Mathematics of Computation, 2024
22024
Eternal domination on prisms of graphs
A Krim-Yee, B Seamone, V Virgile
Discrete Applied Mathematics 283, 734-736, 2020
22020
Further results on Hendry's Conjecture
M Lafond, B Seamone, R Sherkati
Discrete Mathematics & Theoretical Computer Science 24 (Graph Theory), 2022
12022
The speed and threshold of the biased perfect matching game
N Brustle, S Clusiau, VV Narayan, N Ndiaye, B Reed, B Seamone
Procedia Computer Science 195, 190-199, 2021
12021
The speed and threshold of the biased perfect matching and Hamilton cycle games
N Brüstle, S Clusiau, VV Narayan, N Ndiaye, B Reed, B Seamone
Discrete Applied Mathematics 332, 23-40, 2023
2023
The system can't perform the operation now. Try again later.
Articles 1–20