Michael Haythorpe

Available identifiers

zbMath Open haythorpe.michaelMaRDI QIDQ342096

List of research outcomes

Publication	Date of Publication	Type
Variants of the domination number for flower snarks	2024-09-04	Paper
On the crossing numbers of Cartesian products of small graphs with paths, cycles and stars	2024-07-29	Paper
Binary programming formulations for the upper domination problem	2023-10-25	Paper
A Cross Entropy Approach to the Domination Problem and its Variants	2023-09-15	Paper
Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem	2022-01-24	Paper
The secure domination number of Cartesian products of small graphs with paths and cycles	2022-01-13	Paper
Variants of the Domination Number for Flower Snarks	2021-10-05	Paper
Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples	2021-08-23	Paper
Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles	2021-08-16	Paper
An improved binary programming formulation for the secure domination problem	2021-05-05	Paper
Constructing families of cospectral regular graphs	2021-04-30	Paper
There are no cubic graphs on 26 vertices with crossing number 10 or 11	2021-03-17	Paper
A survey of graphs with known or bounded crossing numbers	2020-12-10	Paper
The maximum crossing number of $C_3 \times C_3$	2020-05-13	Paper
ON THE CROSSING NUMBER OF THE CARTESIAN PRODUCT OF A SUNLET GRAPH AND A STAR GRAPH	2019-07-12	Paper
An effective crossing minimisation heuristic based on star insertion	2019-03-18	Paper
Non-Hamiltonian 3-Regular Graphs with Arbitrary Girth	2019-02-27	Paper
A Linearly-growing Conversion from the Set Splitting Problem to the Directed Hamiltonian Cycle Problem	2019-02-27	Paper
On the Crossing Numbers of Cartesian Products of Small Graphs with Paths, Cycles and Stars	2019-02-21	Paper
A construction for directed in-out subgraphs of optimal size	2019-02-13	Paper
FHCP Challenge Set: The First Set of Structurally Difficult Instances of the Hamiltonian Cycle Problem	2018-09-17	Paper
A note on using the resistance-distance matrix to solve Hamiltonian cycle problem	2018-03-23	Paper
Reducing the generalised Sudoku problem to the Hamiltonian cycle problem	2017-01-25	Paper
A new heuristic for detecting non-Hamiltonicity in cubic graphs	2016-11-17	Paper
A Linear-size Conversion of HCP to 3HCP	2015-09-23	Paper
Genetic theory for cubic graphs	2015-08-17	Paper
Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem	2014-10-06	Paper
On the determinant and its derivatives of the rank-one corrected generator of a Markov chain on a graph	2013-08-07	Paper
A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem	2012-03-08	Paper
Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem	2011-04-27	Paper
https://portal.mardi4nfdi.de/entity/Q3062244	2011-01-03	Paper
A conjecture on the prevalence of cubic bridge graphs	2010-12-08	Paper

Research outcomes over time

This page was built for person: Michael Haythorpe