2025.

Transitive (q − 1)-fold packings of PG_n(q)

D.R. Hawtin

Discrete Mathematics - 348 114330

Q1 WOS

2024.

An explicit construction for large sets of infinite dimensional q-Steiner systems.

D.R. Hawtin

Journal of Combinatorial Designs - 32 413–418

Q1 WOS

2024.

A characterisation of edge-affine 2-arc-transitive covers of K_{2^n,2^n}

D.R. Hawtin, C.E. Praeger, and J.-X. Zhou

Journal of Combinatorial Theory, Series A - 207 105919

Q1 WOS Exc

2024.

Using mixed dihedral groups to construct normal Cayley graphs, and a new bipartite 2-arc-transitive graph which is not a Cayley graph.

D.R. Hawtin, C.E. Praeger, and J.-X. Zhou

Journal of Algebraic Combinatorics - 59 561–574

Q1 WOS Q1

2024.

Neighbour-transitive codes in Kneser graphs

D Crnković, DR Hawtin, N Mostarac, A Švob

Journal of Combinatorial Theory, Series A - 204

https://doi.org/10.1016/j.jcta.2023.105850

Q1 WOS Exc

2023.

A family of 2-groups and an associated family of semisymmetric, locally 2-arc-transitive graphs

D.R. Hawtin, J.-X. Zhou, C.E. Praeger

Glasnik Matematički

https://web.math.pmf.unizg.hr/glasnik/forthcoming/pGM7152.pdf

Q3 WOS

2023.

On the classification of binary completely transitive codes with almost-simple top-group

R.F. Bailey and D.R. Hawtin

European Journal of Combinatorics - 107

Q1 WOS

2022.

Neighbour-transitive codes and partial spreads in generalised quadrangles

D. Crnković, D.R. Hawtin and A. Švob

Designs, Codes and Cryptography - 90 1521-1533

https://link.springer.com/article/10.1007/s10623-022-01053-z

Q1 WOS Exc

2022.

The non-existence of block-transitive subspace designs

D.R. Hawtin and J. Lansdown

Combinatorial Theory - 2

https://escholarship.org/uc/item/66t045d3

Q1

2021.

s-Elusive codes in Hamming graphs

D.R. Hawtin

Designs Codes and Cryptography

https://doi.org/10.1007/s10623-021-00868-6

Q1 WOS Exc

2020.

2-Neighbour-Transitive Codes with Small Blocks of Imprimitivity

N.I. Gillespie, D.R. Hawtin, C.E. Praeger

Electronic Journal of Combinatorics - 27

https://doi.org/10.37236/8040

Q1 WOS

2020.

Minimal binary 2-neighbour-transitive codes

D.R. Hawtin, C.E. Praeger

Journal of Combinatorial Theory, Series A - 171

https://doi.org/10.1016/j.jcta.2019.105173

Q1 WOS Exc

2020.

On the 486-vertex distance-regular graphs of Koolen-Riebeek and Soicher

D.R. Hawtin, R.F. Bailey

Electronic Journal of Combinatorics - 27

https://doi.org/10.37236/8954

Q1 WOS

2018.

The circular altitude of a graph

J. Bamberg, A. Devillers, I. Pivotto, B. Corr, D.R. Hawtin,

Australasian Journal of Combinatorics - 72 357-368

https://ajc.maths.uq.edu.au/pdf/72/ajc_v72_p357.pdf

Q2 WOS

2018.

Alphabet-almost-simple 2-neighbour-transitive codes

N.I. Gillespie, D.R. Hawtin

Ars Mathematica Contemporanea - 14 345-357

https://doi.org/10.26493/1855-3974.1240.515

Q2 WOS

2016.

Entry-faithful 2-neighbour transitive codes

N.I. Gillespie, M. Giudici, D.R. Hawtin, C.E. Praeger

Designs Codes and Cryptography - 79 549-564

https://doi.org/10.1007/s10623-015-0069-3

Q1 WOS Exc

2013.

Elusive codes in Hamming graphs

D.R. Hawtin, N.I. Gillespie, C.E. Praeger

Bulletin of the Australian Mathematical Society - 88 286-296

https://doi.org/10.1017/S0004972713000051

Q2 WOS

2025.

Group actions on codes in graphs

D.R. Hawtin and C.E. Praeger

In "Completely Regular Codes in Distance Regular Graphs"

M. Shi and P. Sole (Eds.)

Chapman and Hall/CRC