Michael Haythorpe

From MaRDI portal
Revision as of 13:41, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:342096

Available identifiers

zbMath Open haythorpe.michaelMaRDI QIDQ342096

List of research outcomes

PublicationDate of PublicationType
Binary programming formulations for the upper domination problem2023-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 problem2022-01-24Paper
The secure domination number of Cartesian products of small graphs with paths and cycles2022-01-13Paper
Variants of the Domination Number for Flower Snarks2021-10-05Paper
Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples2021-08-23Paper
Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles2021-08-16Paper
An improved binary programming formulation for the secure domination problem2021-05-05Paper
Constructing families of cospectral regular graphs2021-04-30Paper
There are no cubic graphs on 26 vertices with crossing number 10 or 112021-03-17Paper
A survey of graphs with known or bounded crossing numbers2020-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 GRAPH2019-07-12Paper
An effective crossing minimisation heuristic based on star insertion2019-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
A construction for directed in-out subgraphs of optimal size2019-02-13Paper
FHCP Challenge Set: The First Set of Structurally Difficult Instances of the Hamiltonian Cycle Problem2018-09-17Paper
A note on using the resistance-distance matrix to solve Hamiltonian cycle problem2018-03-23Paper
Reducing the generalised Sudoku problem to the Hamiltonian cycle problem2017-01-25Paper
A new heuristic for detecting non-Hamiltonicity in cubic graphs2016-11-17Paper
A Linear-size Conversion of HCP to 3HCP2015-09-23Paper
Genetic theory for cubic graphs2015-08-17Paper
Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem2014-10-06Paper
On the determinant and its derivatives of the rank-one corrected generator of a Markov chain on a graph2013-08-07Paper
A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem2012-03-08Paper
Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem2011-04-27Paper
https://portal.mardi4nfdi.de/entity/Q30622442011-01-03Paper
A conjecture on the prevalence of cubic bridge graphs2010-12-08Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Michael Haythorpe