Cycles through four edges in 3-connected cubic graphs. - Robert E. L. Aldred; Derek A. Holton; Carsten Thomassen (Graphs Comb., 1985)

Cycles through five edges in 3-connected cubic graphs. - Robert E. L. Aldred; Derek A. Holton (Graphs Comb., 1987)

Distance-regular antipodai covering graphs. - Robert E. L. Aldred; Chris D. Godsil (J. Comb. Theory B, 1988)

An 11-vertex theorem for 3-connected cubic graphs. - Robert E. L. Aldred; Sheng Bau; Derek A. Holton; Gordon F. Royle (J. Graph Theory, 1988)

Uniform cyclic edge connectivity in cubic graphs. - Robert E. L. Aldred; Derek A. Holton; Bill Jackson (Comb., 1991)

Partitioning regular graphs into equicardinal linear forests. - Robert E. L. Aldred; Bill Jackson; Dingjun Lou; Akira Saito (Discret. Math., 1991)

Note on distance-regular graphs with a pair of equal subdegrees. - Robert E. L. Aldred (Australas. J Comb., 1992)

Maximum matchings in 3-connected graphs contain contractible edges. - Robert E. L. Aldred; Robert L. Hemminger; Xingxing Yu (Australas. J Comb., 1992)

N-extendability of symmetric graphs. - Robert E. L. Aldred; Derek A. Holton; Dingjun Lou (J. Graph Theory, 1993)

The 3-connected graphs having a longest cycle containing only three contractible edges. - Robert E. L. Aldred; Robert L. Hemminger; Katsuhiro Ota (J. Graph Theory, 1993)

A degree characterisation of pancyclicity. - Robert E. L. Aldred; Derek A. Holton; Zang Ke Min (Discret. Math., 1994)

On Hamilton cycles and contractible edges in 3-connected graphs. - Robert E. L. Aldred; Robert L. Hemminger (Australas. J Comb., 1995)

On the density of sets of divisors. - Robert E. L. Aldred; Richard P. Anstee (Discret. Math., 1995)

The 3-connected graphs with a longest path containing precisely two contractible edges. - Robert E. L. Aldred; Chen Jian; Robert L. Hemminger (Australas. J Comb., 1996)

Matching extensions with prescribed and forbidden edges. - M. I. Porteous; Robert E. L. Aldred (Australas. J Comb., 1996)

Cycles in quasi 4-connected graphs. - Robert E. L. Aldred; Mark N. Ellingham; Robert L. Hemminger; Derek A. Holton (Australas. J Comb., 1997)

On the Number of Cycles in 3-Connected Cubic Graphs. - Robert E. L. Aldred; Carsten Thomassen (J. Comb. Theory B, 1997)

P3-isomorphisms for graphs. - Robert E. L. Aldred; Mark N. Ellingham; Robert L. Hemminger; Peter Jipsen (J. Graph Theory, 1997)

More on the linear k-arboricity of regular graphs. - Robert E. L. Aldred; Nicholas C. Wormald (Australas. J Comb., 1998)

Planar graphs, regular graphs, bipartite graphs and Hamiltonicity. - Derek A. Holton; Robert E. L. Aldred (Australas. J Comb., 1999)

Two results on matching extensions with prescribed and proscribed edge sets. - Robert E. L. Aldred; Derek A. Holton; M. I. Porteous; Michael D. Plummer (Discret. Math., 1999)

On matching extensions with prescribed and proscribed edge sets II. - Robert E. L. Aldred; Michael D. Plummer (Discret. Math., 1999)

Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs. - Robert E. L. Aldred; Sheng Bau; Derek A. Holton; Brendan D. McKay (Graphs Comb., 1999)

Planar graphs, regular graphs, bipartite graphs and Hamiltonicity: Corrigendum. - Derek A. Holton; Robert E. L. Aldred (Australas. J Comb., 2000)

Nonhamiltonian 3-Connected Cubic Planar Graphs. - Robert E. L. Aldred; Sheng Bau; Derek A. Holton; Brendan D. McKay (SIAM J. Discret. Math., 2000)

Algorithms for Pattern Involvement in Permutations. - Michael H. Albert; Robert E. L. Aldred; Mike D. Atkinson; Derek A. Holton (ISAAC, 2001)

On 3*-connected graphs. - Michael H. Albert; Robert E. L. Aldred; Derek A. Holton (Australas. J Comb., 2001)

On restricted matching extension in planar graphs. - Robert E. L. Aldred; Michael D. Plummer (Discret. Math., 2001)

Permutations of a Multiset Avoiding Permutations of Length 3. - Michael H. Albert; Robert E. L. Aldred; Mike D. Atkinson; Chris C. Handley; Derek A. Holton (Eur. J. Comb., 2001)

Longest subsequences in permutations. - Michael H. Albert; Robert E. L. Aldred; Michael D. Atkinson; Hans P. van Ditmarsch; B. D. Handley; Chris C. Handley; Jaroslav Opatrny (Australas. J Comb., 2003)

M-alternating paths in n-extendable bipartite graphs. - Robert E. L. Aldred; Derek A. Holton; Dingjun Lou; Akira Saito (Discret. Math., 2003)

A note on the number of graceful labellings of paths. - Robert E. L. Aldred; Jozef Sirán; Martin Sirán (Discret. Math., 2003)

Edge proximity and matching extension in planar triangulations. - Robert E. L. Aldred; Michael D. Plummer (Australas. J Comb., 2004)

Restricted permutations and queue jumping. - Michael H. Albert; Robert E. L. Aldred; Mike D. Atkinson; Hans P. van Ditmarsch; Chris C. Handley; Derek A. Holton (Discret. Math., 2004)

Characterizing 2k-critical graphs and n-extendable graphs. - Robert E. L. Aldred; Derek A. Holton; Dingjun Lou; Ning Zhong (Discret. Math., 2004)

Graphs with not all possible path-kernels. - Robert E. L. Aldred; Carsten Thomassen (Discret. Math., 2004)

Graphs and digraphs with all 2-factors isomorphic. - Marién Abreu; Robert E. L. Aldred; Martin Funk; Bill Jackson; Domenico Labbate; John Sheehan (J. Comb. Theory B, 2004)

Regular bipartite graphs with all 2-factors isomorphic. - Robert E. L. Aldred; Martin Funk; Bill Jackson; Domenico Labbate; John Sheehan (J. Comb. Theory B, 2004)

Safe communication for card players by combinatorial designs for two-step protocols. - Michael H. Albert; Robert E. L. Aldred; Mike D. Atkinson; Hans P. van Ditmarsch; Chris C. Handley (Australas. J Comb., 2005)

Sorting Classes. - Michael H. Albert; Robert E. L. Aldred; Mike D. Atkinson; Chris C. Handley; Derek A. Holton; D. J. McCaughan; Hans P. van Ditmarsch (Electron. J. Comb., 2005)

Vertex colouring edge partitions. - Louigi Addario-Berry; Robert E. L. Aldred; Ketan Dalal; Bruce A. Reed (J. Comb. Theory B, 2005)

2-factors with prescribed and proscribed edges. - Robert E. L. Aldred; Derek A. Holton; John Sheehan (J. Graph Theory, 2005)

Permuting machines and priority queues. - Robert E. L. Aldred; Mike D. Atkinson; Hans P. van Ditmarsch; Chris C. Handley; Derek A. Holton; D. J. McCaughan (Theor. Comput. Sci., 2005)

Compositions of pattern restricted sets of permutations. - Michael H. Albert; Robert E. L. Aldred; Mike D. Atkinson; Hans P. van Ditmarsch; Chris C. Handley; Derek A. Holton; D. J. McCaughan (Australas. J Comb., 2007)

Cyclically closed pattern classes of permutations. - Michael H. Albert; Robert E. L. Aldred; Mike D. Atkinson; Hans P. van Ditmarsch; Chris C. Handley; Derek A. Holton; D. J. McCaughan; C. W. Monteith (Australas. J Comb., 2007)

Perfect matchings after vertex deletions. - Robert E. L. Aldred; Richard P. Anstee; Stephen C. Locke (Discret. Math., 2007)

Edge proximity conditions for extendability in cubic bipartite graphs. - Robert E. L. Aldred; Bill Jackson (J. Graph Theory, 2007)

Restricted matching in graphs of small genus. - Robert E. L. Aldred; Michael D. Plummer (Discret. Math., 2008)

On the matching extendability of graphs in surfaces. - Robert E. L. Aldred; Ken-ichi Kawarabayashi; Michael D. Plummer (J. Comb. Theory B, 2008)

On the maximum number of cycles in a planar graph. - Robert E. L. Aldred; Carsten Thomassen (J. Graph Theory, 2008)

Two forbidden subgraphs and the existence of a 2-factor in graphs. - Robert E. L. Aldred; Jun Fujisawa; Akira Saito (Australas. J Comb., 2009)

Graph structural properties of non-Yutsis graphs allowing fast recognition. - Robert E. L. Aldred; Dries Van Dyck; Gunnar Brinkmann; Veerle Fack; Brendan D. McKay (Discret. Appl. Math., 2009)

Corrigendum to "Graphs and digraphs with all 2-factors isomorphic" [J. Combin. Theory Ser. B 92 (2) (2004) 395-404]. - Marién Abreu; Robert E. L. Aldred; Martin Funk; Bill Jackson; Domenico Labbate; John Sheehan (J. Comb. Theory B, 2009)

Avoiding consecutive patterns in permutations. - Robert E. L. Aldred; Mike D. Atkinson; D. J. McCaughan (Adv. Appl. Math., 2010)

Distance-restricted matching extension in planar triangulations. - Robert E. L. Aldred; Michael D. Plummer (Discret. Math., 2010)

The structure of 4-gamma-critical graphs with a cut vertex. - Watcharaphong Ananchuen; Nawarat Ananchuen; Robert E. L. Aldred (Discret. Math., 2010)

Forbidden subgraphs and the existence of a 2-factor. - Robert E. L. Aldred; Jun Fujisawa; Akira Saito (J. Graph Theory, 2010)

The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity. - Robert E. L. Aldred; Yoshimi Egawa; Jun Fujisawa; Katsuhiro Ota; Akira Saito (J. Graph Theory, 2011)

Proximity thresholds for matching extension in planar and projective planar triangulations. - Robert E. L. Aldred; Michael D. Plummer (J. Graph Theory, 2011)

Graphs with the cycle extension property. - Robert E. L. Aldred; Michael D. Plummer (Australas. J Comb., 2012)

The maximum number of minimal codewords in an $[n,k]-$code - Adel Alahmadi; Robert E. L. Aldred; Romar dela Cruz; Patrick Solé; Carsten Thomassen (CoRR, 2012)

Proximity thresholds for matching extension in the torus and Klein bottle. - Robert E. L. Aldred; Michael D. Plummer (Discret. Appl. Math., 2012)

Matching extension in quadrangulations of the torus. - Robert E. L. Aldred; Qiuli Li; Michael D. Plummer; Heping Zhang (Australas. J Comb., 2013)

The maximum number of minimal codewords in long codes. - Adel Alahmadi; Robert E. L. Aldred; Romar dela Cruz; Patrick Solé; Carsten Thomassen (Discret. Appl. Math., 2013)

The maximum number of minimal codewords in an [n, k][n, k]-code. - Adel Alahmadi; Robert E. L. Aldred; Romar dela Cruz; Patrick Solé; Carsten Thomassen (Discret. Math., 2013)

Distance-Restricted Matching Extension in Triangulations of the Torus and the Klein Bottle. - Robert E. L. Aldred; Jun Fujisawa (Electron. J. Comb., 2014)

Matching extension in toroidal quadrangulations II: the 3-extendable case. - Robert E. L. Aldred; Qiuli Li; Michael D. Plummer; Dong Ye 002; Heping Zhang (Australas. J Comb., 2015)

The minimum number of minimal codewords in an [n, k]-code and in graphic codes. - Adel Alahmadi; Robert E. L. Aldred; Romar dela Cruz; Seongmin Ok; Patrick Solé; Carsten Thomassen (Discret. Appl. Math., 2015)

Extending a perfect matching to a Hamiltonian cycle. - Adel Alahmadi; Robert E. L. Aldred; Ahmad Alkenani; Rola Hijazi; Patrick Solé; Carsten Thomassen (Discret. Math. Theor. Comput. Sci., 2015)

Edge-disjoint node-independent spanning trees in dense Gaussian networks. - Bader F. AlBdaiwi; Zaid A. Hussain; Anton Cerný; Robert E. L. Aldred (J. Supercomput., 2016)

Matching extension in prism graphs. - Robert E. L. Aldred; Michael D. Plummer (Discret. Appl. Math., 2017)

Edge proximity and matching extension in punctured planar triangulations. - Robert E. L. Aldred; Jun Fujisawa; Akira Saito (Discret. Math., 2017)

Pairs and triples of forbidden subgraphs and the existence of a 2-factor. - Robert E. L. Aldred; Jun Fujisawa; Akira Saito (J. Graph Theory, 2019)

Restricted matching in plane triangulations and near triangulations. - Robert E. L. Aldred; Michael D. Plummer; Watcharintorn Ruksasakchai (Discret. Appl. Math., 2020)

Extendability and Criticality in Matching Theory. - Robert E. L. Aldred; Michael D. Plummer (Graphs Comb., 2020)

Cycles in 5-connected triangulations. - Adel Alahmadi; Robert E. L. Aldred; Carsten Thomassen (J. Comb. Theory, Ser. B, 2020)

Distance matching extension and local structure of graphs. - Robert E. L. Aldred; Jun Fujisawa; Akira Saito (J. Graph Theory, 2020)

Distance restricted matching extension missing vertices and edges in 5-connected triangulations of the plane. - Robert E. L. Aldred; Michael D. Plummer; Watcharintorn Ruksasakchai (J. Graph Theory, 2020)

Asymmetric distance matching extension. - Robert E. L. Aldred; Michael D. Plummer; Watcharintorn Ruksasakchai (Australas. J Comb., 2021)

Distance Matching Extension in Cubic Bipartite Graphs. - Robert E. L. Aldred; Jun Fujisawa; Akira Saito (Graphs Comb., 2021)

Removal of subgraphs and perfect matchings in graphs on surfaces. - Robert E. L. Aldred; Jun Fujisawa (J. Graph Theory, 2023)

Edge proximity conditions for extendability in regular bipartite graphs. - Robert E. L. Aldred; Bill Jackson; Michael D. Plummer (J. Graph Theory, 2023)