John Haslegrave

According to our database, John Haslegrave authored at least 31 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Tight bounds on the chromatic edge stability index of graphs.

Saieed Akbari, John Haslegrave, Mehrbod Javadi, Nasim Nahvi, Helia Niaparast

Discret. Math., April, 2024

When removing an independent set is optimal for reducing the chromatic number.

Stijn Cambie, John Haslegrave, Ross J. Kang

Eur. J. Comb., January, 2024

2023

Monitoring edge-geodetic sets: Hardness and graph products.

John Haslegrave

Discret. Appl. Math., December, 2023

Determining triangulations and quadrangulations by boundary distances.

John Haslegrave

J. Comb. Theory, Ser. B, November, 2023

Sum Index, Difference Index and Exclusive Sum Number of Graphs.

John Haslegrave

Graphs Comb., April, 2023

Countable graphs are majority 3-choosable.

John Haslegrave

Discuss. Math. Graph Theory, 2023

2022

Crux and Long Cycles in Graphs.

John Haslegrave, Jie Hu, Jaehoon Kim, Hong Liu, Bingyu Luan, Guanghui Wang

SIAM J. Discret. Math., December, 2022

Time Dependent Biased Random Walks.

John Haslegrave, Thomas Sauerwald, John Sylvester

ACM Trans. Algorithms, 2022

The number and average size of connected sets in graphs with degree constraints.

John Haslegrave

J. Graph Theory, 2022

The path minimises the average size of a connected induced subgraph.

John Haslegrave

Discret. Math., 2022

The power of two choices for random walks.

Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester

Comb. Probab. Comput., 2022

Degrees in Link Graphs of Regular Graphs.

Itai Benjamini, John Haslegrave

Electron. J. Comb., 2022

On the relationship between variable Wiener index and variable Szeged index.

Stijn Cambie, John Haslegrave

Appl. Math. Comput., 2022

2021

Site percolation and isoperimetric inequalities for plane graphs.

John Haslegrave, Christoforos Panagiotis

Random Struct. Algorithms, 2021

2020

Condensation in preferential attachment models with location-based choice.

John Haslegrave, Jonathan H. Jordan, Mark Yarrow

Random Struct. Algorithms, 2020

Percolation on an infinitely generated group.

Agelos Georgakopoulos, John Haslegrave

Comb. Probab. Comput., 2020

Choice and Bias in Random Walks.

Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019

Forcing large tight components in 3-graphs.

Agelos Georgakopoulos, John Haslegrave, Richard Montgomery

Eur. J. Comb., 2019

2018

Proof of a local antimagic conjecture.

John Haslegrave

Discret. Math. Theor. Comput. Sci., 2018

Locating a robber with multiple probes.

John Haslegrave, Richard A. B. Johnson, Sebastian Koch

Discret. Math., 2018

2017

Reaching consensus on a connected graph.

John Haslegrave, Mate Puljiz

J. Appl. Probab., 2017

Majority dynamics with one nonconformist.

John Haslegrave, Chris Cannings

Discret. Appl. Math., 2017

2016

Preferential attachment with choice.

John Haslegrave, Jonathan H. Jordan

Random Struct. Algorithms, 2016

Subdivisions in the Robber Locating game.

John Haslegrave, Richard A. B. Johnson, Sebastian Koch

Discret. Math., 2016

The Robber Locating game.

John Haslegrave, Richard A. B. Johnson, Sebastian Koch

Discret. Math., 2016

2014

Bounds on Herman's algorithm.

John Haslegrave

Theor. Comput. Sci., 2014

Extremal results on average subtree density of series-reduced trees.

John Haslegrave

J. Comb. Theory, Ser. B, 2014

An evasion game on a graph.

John Haslegrave

Discret. Math., 2014

Judicious partitions of uniform hypergraphs.

John Haslegrave

Comb., 2014

2013

The Robber Locating game.

John Haslegrave

CoRR, 2013

2012

The Bollobás-Thomason conjecture for 3-uniform hypergraphs.

John Haslegrave

Comb., 2012