The following pages link to Michael Haythorpe (Q342096):
Displaying 27 items.
- A new heuristic for detecting non-Hamiltonicity in cubic graphs (Q342098) (← links)
- Reducing the generalised Sudoku problem to the Hamiltonian cycle problem (Q504159) (← links)
- A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem (Q666352) (← links)
- Deterministic ``snakes and ladders'' heuristic for the Hamiltonian cycle problem (Q744218) (← links)
- An improved binary programming formulation for the secure domination problem (Q828823) (← links)
- A note on using the resistance-distance matrix to solve Hamiltonian cycle problem (Q1708538) (← links)
- The secure domination number of Cartesian products of small graphs with paths and cycles (Q2065763) (← links)
- Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem (Q2070343) (← links)
- On the determinant and its derivatives of the rank-one corrected generator of a Markov chain on a graph (Q2393062) (← links)
- Genetic theory for cubic graphs (Q2517298) (← links)
- There are no cubic graphs on 26 vertices with crossing number 10 or 11 (Q2657046) (← links)
- A Linear-size Conversion of HCP to 3HCP (Q2947382) (← links)
- A conjecture on the prevalence of cubic bridge graphs (Q3059087) (← links)
- (Q3062244) (← links)
- An effective crossing minimisation heuristic based on star insertion (Q3121515) (← links)
- Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem (Q3169065) (← links)
- A construction for directed in-out subgraphs of optimal size (Q4622626) (← links)
- ON THE CROSSING NUMBER OF THE CARTESIAN PRODUCT OF A SUNLET GRAPH AND A STAR GRAPH (Q4968453) (← links)
- Constructing families of cospectral regular graphs (Q4987254) (← links)
- Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles (Q5006572) (← links)
- Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples (Q5009933) (← links)
- A survey of graphs with known or bounded crossing numbers (Q5139701) (← links)
- FHCP Challenge Set: The First Set of Structurally Difficult Instances of the Hamiltonian Cycle Problem (Q5376425) (← links)
- Binary programming formulations for the upper domination problem (Q6080758) (← links)
- On the crossing numbers of Cartesian products of small graphs with paths, cycles and stars (Q6580155) (← links)
- Variants of the domination number for flower snarks (Q6597991) (← links)
- A Systematic Approach to Crossing Numbers of Cartesian Products with Paths (Q6743927) (← links)
