Michael Haythorpe

From MaRDI portal
(Redirected from Person:342096)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Variants of the domination number for flower snarks
Ars Mathematica Contemporanea
2024-09-04Paper
On the crossing numbers of Cartesian products of small graphs with paths, cycles and stars
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing
2024-07-29Paper
Binary programming formulations for the upper domination problem
Mathematical Methods of Operations Research
2023-10-25Paper
A Cross Entropy Approach to the Domination Problem and its Variants2023-09-15Paper
Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem
Computational Optimization and Applications
2022-01-24Paper
The secure domination number of Cartesian products of small graphs with paths and cycles
Discrete Applied Mathematics
2022-01-13Paper
Variants of the Domination Number for Flower Snarks2021-10-05Paper
Change ringing and Hamiltonian cycles: the search for Erin and Stedman triples
Electronic Journal of Graph Theory and Applications
2021-08-23Paper
Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles
Electronic Journal of Graph Theory and Applications
2021-08-16Paper
An improved binary programming formulation for the secure domination problem
Annals of Operations Research
2021-05-05Paper
Constructing families of cospectral regular graphs
Combinatorics, Probability and Computing
2021-04-30Paper
There are no cubic graphs on 26 vertices with crossing number 10 or 11
Graphs and Combinatorics
2021-03-17Paper
A survey of graphs with known or bounded crossing numbers2020-12-10Paper
A survey of graphs with known or bounded crossing numbers
(available as arXiv preprint)
2020-12-10Paper
The maximum crossing number of $C_3 \times C_3$2020-05-13Paper
On the crossing number of the Cartesian product of a sunlet graph and a star graph
Bulletin of the Australian Mathematical Society
2019-07-12Paper
An effective crossing minimisation heuristic based on star insertion
Journal of Graph Algorithms and Applications
2019-03-18Paper
Non-Hamiltonian 3-Regular Graphs with Arbitrary Girth2019-02-27Paper
A Linearly-growing Conversion from the Set Splitting Problem to the Directed Hamiltonian Cycle Problem2019-02-27Paper
On the Crossing Numbers of Cartesian Products of Small Graphs with Paths, Cycles and Stars2019-02-21Paper
Directed in-out graphs of optimal size2019-02-13Paper
Directed in-out graphs of optimal size
(available as arXiv preprint)
2019-02-13Paper
FHCP challenge set: the first set of structurally difficult instances of the Hamiltonian cycle problem
(available as arXiv preprint)
2018-09-17Paper
A note on using the resistance-distance matrix to solve Hamiltonian cycle problem
Annals of Operations Research
2018-03-23Paper
Reducing the generalised Sudoku problem to the Hamiltonian cycle problem
AKCE International Journal of Graphs and Combinatorics
2017-01-25Paper
A new heuristic for detecting non-Hamiltonicity in cubic graphs
Computers & Operations Research
2016-11-17Paper
A linear-size conversion of HCP to 3HCP2015-09-23Paper
A linear-size conversion of HCP to 3HCP
(available as arXiv preprint)
2015-09-23Paper
Genetic theory for cubic graphs
SpringerBriefs in Operations Research
2015-08-17Paper
Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem
Mathematical Programming Computation
2014-10-06Paper
On the determinant and its derivatives of the rank-one corrected generator of a Markov chain on a graph
Journal of Global Optimization
2013-08-07Paper
A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem
Annals of Operations Research
2012-03-08Paper
Refined MDP-based branch-and-fix algorithm for the Hamiltonian cycle problem
Mathematics of Operations Research
2011-04-27Paper
Finding Hamiltonian cycles using an interior point method2011-01-03Paper
A conjecture on the prevalence of cubic bridge graphs
Discussiones Mathematicae Graph Theory
2010-12-08Paper


Research outcomes over time


This page was built for person: Michael Haythorpe