default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Haslegrave
Person information
- affiliation: University of Warwick, Coventry, UK
- affiliation: University of Sheffield, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j30]John Haslegrave, Alex D. Scott, Youri Tamitegama, Jane Tan:
Boundary rigidity of 3D CAT(0) cube complexes. Eur. J. Comb. 124: 104077 (2025)- 2024
- [j29]Saieed Akbari, John Haslegrave
, Mehrbod Javadi, Nasim Nahvi, Helia Niaparast:
Tight bounds on the chromatic edge stability index of graphs. Discret. Math. 347(4): 113850 (2024) - [j28]Stijn Cambie, John Haslegrave, Ross J. Kang:
When removing an independent set is optimal for reducing the chromatic number. Eur. J. Comb. 115: 103781 (2024) - 2023
- [j27]John Haslegrave:
Monitoring edge-geodetic sets: Hardness and graph products. Discret. Appl. Math. 340: 79-84 (2023) - [j26]John Haslegrave:
Countable graphs are majority 3-choosable. Discuss. Math. Graph Theory 43(2): 499-506 (2023) - [j25]John Haslegrave:
Sum Index, Difference Index and Exclusive Sum Number of Graphs. Graphs Comb. 39(2): 32 (2023) - [j24]John Haslegrave:
Determining triangulations and quadrangulations by boundary distances. J. Comb. Theory B 163: 233-255 (2023) - 2022
- [j23]Stijn Cambie, John Haslegrave:
On the relationship between variable Wiener index and variable Szeged index. Appl. Math. Comput. 431: 127320 (2022) - [j22]Itai Benjamini, John Haslegrave:
Degrees in Link Graphs of Regular Graphs. Electron. J. Comb. 29(2) (2022) - [j21]Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester:
The power of two choices for random walks. Comb. Probab. Comput. 31(1): 73-100 (2022) - [j20]John Haslegrave:
The path minimises the average size of a connected induced subgraph. Discret. Math. 345(5): 112799 (2022) - [j19]John Haslegrave:
The number and average size of connected sets in graphs with degree constraints. J. Graph Theory 100(3): 530-542 (2022) - [j18]John Haslegrave, Jie Hu, Jaehoon Kim, Hong Liu, Bingyu Luan, Guanghui Wang:
Crux and Long Cycles in Graphs. SIAM J. Discret. Math. 36(4): 2942-2958 (2022) - [j17]John Haslegrave, Thomas Sauerwald, John Sylvester:
Time Dependent Biased Random Walks. ACM Trans. Algorithms 18(2): 12:1-12:30 (2022) - [i6]John Haslegrave:
Monitoring edge-geodetic sets: hardness and graph products. CoRR abs/2210.08955 (2022) - 2021
- [j16]John Haslegrave, Christoforos Panagiotis:
Site percolation and isoperimetric inequalities for plane graphs. Random Struct. Algorithms 58(1): 150-163 (2021) - [i5]John Haslegrave:
Determining triangulations and quadrangulations by boundary distances. CoRR abs/2111.13556 (2021) - 2020
- [j15]Agelos Georgakopoulos, John Haslegrave:
Percolation on an infinitely generated group. Comb. Probab. Comput. 29(4): 587-615 (2020) - [j14]John Haslegrave, Jonathan H. Jordan, Mark Yarrow:
Condensation in preferential attachment models with location-based choice. Random Struct. Algorithms 56(3): 775-795 (2020) - [c1]Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester:
Choice and Bias in Random Walks. ITCS 2020: 76:1-76:19 - [i4]John Haslegrave, Thomas Sauerwald, John Sylvester:
Time Dependent Biased Random Walks. CoRR abs/2006.02475 (2020)
2010 – 2019
- 2019
- [j13]Agelos Georgakopoulos, John Haslegrave, Richard Montgomery:
Forcing large tight components in 3-graphs. Eur. J. Comb. 77: 57-67 (2019) - [i3]Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester:
The Power of Two Choices for Random Walks. CoRR abs/1911.05170 (2019) - 2018
- [j12]John Haslegrave, Richard A. B. Johnson, Sebastian Koch:
Locating a robber with multiple probes. Discret. Math. 341(1): 184-193 (2018) - [j11]John Haslegrave:
Proof of a local antimagic conjecture. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - 2017
- [j10]John Haslegrave, Chris Cannings:
Majority dynamics with one nonconformist. Discret. Appl. Math. 219: 32-39 (2017) - [j9]John Haslegrave, Mate Puljiz:
Reaching consensus on a connected graph. J. Appl. Probab. 54(1): 181-198 (2017) - 2016
- [j8]John Haslegrave, Richard A. B. Johnson, Sebastian Koch:
The Robber Locating game. Discret. Math. 339(1): 109-117 (2016) - [j7]John Haslegrave, Richard A. B. Johnson, Sebastian Koch:
Subdivisions in the Robber Locating game. Discret. Math. 339(11): 2804-2811 (2016) - [j6]John Haslegrave, Jonathan H. Jordan:
Preferential attachment with choice. Random Struct. Algorithms 48(4): 751-766 (2016) - 2014
- [j5]John Haslegrave:
Judicious partitions of uniform hypergraphs. Comb. 34(5): 561-572 (2014) - [j4]John Haslegrave:
An evasion game on a graph. Discret. Math. 314: 1-5 (2014) - [j3]John Haslegrave:
Extremal results on average subtree density of series-reduced trees. J. Comb. Theory B 107: 26-41 (2014) - [j2]John Haslegrave:
Bounds on Herman's algorithm. Theor. Comput. Sci. 550: 100-106 (2014) - [i2]John Haslegrave:
Bounds on Herman's algorithm. CoRR abs/1405.5209 (2014) - 2013
- [i1]John Haslegrave:
The Robber Locating game. CoRR abs/1311.3867 (2013) - 2012
- [j1]John Haslegrave:
The Bollobás-Thomason conjecture for 3-uniform hypergraphs. Comb. 32(4): 451-471 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
