44 citations · 327 across the 39 of their papers we have counts for
4 papers · 1 filter
Competing types in preferential attachment graphs with community structure
John Haslegrave, Jonathan Jordan, Mark Yarrow
We extend the two-type preferential attachment model of Antunović, Mossel and Rácz, where each new vertex takes its type according to a defined rule based on the types of its neigh…
Monitoring edge-geodetic sets: hardness and graph products
John Haslegrave
Foucaud, Krishna and Lekshmi recently introduced the concept of monitoring edge-geodetic sets in graphs, and a related graph invariant. These are sets of vertices such that the rem…
Tight Bounds on the Chromatic Edge Stability Index of Graphs
Saieed Akbari, John Haslegrave, Mehrbod Javadi +2
The chromatic edge stability index of a graph is the minimum number of edges whose removal results in a graph with smaller chromatic index. We give best-p…
When removing an independent set is optimal for reducing the chromatic number
Stijn Cambie, John Haslegrave, Ross J. Kang
How large must the chromatic number of a graph be, in terms of the graph's maximum degree, to ensure that the most efficient way to reduce the chromatic number by removing vertices…