Researcher


Deprecated: Function get_magic_quotes_gpc() is deprecated in /var/www/html/www5chris.dawsoncollege.qc.ca/wp-includes/formatting.php on line 4358
Seamone1 (1280×1247)

Ben Seamone

Dr. Ben Seamone’s research is in graph Theory, with a primary focus on graph colouring and labelling, cycles in graphs (particularly Hamiltonian cycles and cycle extendibility), extremal graph theory, and graph searching. Ben was awarded an FRQNT research grant (2014-17) for his project entitled  “A study on path and cycle based properties of graphs”.  In addition, he holds an appointment as an adjunct researcher (“professeur associé”) at the l’Université de Montréal.

Publications

  • On uniquely Hamiltonian claw-free and triangle-free graphs.  Discussiones Mathematicae Graph Theory (2014).
  • Hamiltonian chordal graphs are not cycle extendable”. Society for Industrial and Applied Mathematics (SIAM) Journal on Discrete Mathematics (2014) (with M. Lafond).
  • Sequence variations of the 1-2-3 Conjecture and irregularity strength. Discrete Math. Theor. Comput. Sci., 15:1 (2013), 15–28 (with B. Stevens).
  • Vertex-colouring edge-weightings with two edge weights. Discrete Math. Theor. Comput. Sci., 14:1 (2012), 1–20 (with M. Khatirinejad, R. Naserasr, M. Newman, B. Stevens).
  • Spanning Trees with Specified Differences in Cayley Graphs. Discrete Math., 312:17 (2012), 2561–2565 (with B. Stevens)
  • p=2-Angle Yao Graphs are Spanners. Internat. J. Comput. Geom. Appl., 22:1 (2012), 61-82 (with P. Bose, M. Damian, K. Dou¨ıeb, J. O’Rourke, M. Smid, S. Wuhrer)
  • Digraphs are 2-weight choosable. Electron. J. Combin., 18 (2011), #P21 (with M. Khatirinejad, R. Naserasr, M. Newman, B. Stevens).

Education

  • PhD, 2012, Applied Mathematics, Carleton University
  • MSc, 2005, Combinatorics & Optimization, University of Waterloo
  • BSC, 2003, Mathematics, Mount Allison University

 

Last Modified: October 17, 2016