Dr. Ben Seamone holds a PhD, in Applied Mathematics from Carleton University. The basis of his research is in Graph Theory, which includes but is not limited to graph colouring and labelling, cycles in graphs (particularly Hamiltonian cycles and cycle extendibility), extremal graph theory, probabilistic methods in graph theory and graph searching. This past year Ben was awarded an FRQNT research grant for 2014-17 on “A study on path and cycle based properties of graphs”. In addition, he is an NSERC post doctoral fellow at Université de Montréal.
Abstract structures, combinatorics, communication technology.
Contributions to Dawson’s Community:
Seamone, Ben. “On uniquely Hamiltonian claw-free and triangle-free graphs”. Discussiones Mathematicae Graph Theory (2014).
M. Lafond & Ben Seamone. “Hamiltonian chordal graphs are not cycle extendable”. Society for Industrial and Applied Mathematics (SIAM) Journal on Discrete Mathematics (2014)
For more information check out Ben’s website.
Return to Researcher Profiles