Robert E. L. Aldred

Publication Activity (10 Years)

Years Active: 1985-2023
Publications (10 Years): 17

Top Topics

Bipartite Graph

Top Venues

J. Graph Theory

Discret. Appl. Math.

Australas. J Comb.

Publications

Robert E. L. Aldred, Jun Fujisawa
Removal of subgraphs and perfect matchings in graphs on surfaces. J. Graph Theory 102 (2) (2023)
Robert E. L. Aldred, Bill Jackson, Michael D. Plummer
Edge proximity conditions for extendability in regular bipartite graphs. J. Graph Theory 104 (2) (2023)
Robert E. L. Aldred, Michael D. Plummer, Watcharintorn Ruksasakchai
Asymmetric distance matching extension. Australas. J Comb. 79 (2021)
Robert E. L. Aldred, Jun Fujisawa, Akira Saito
Distance Matching Extension in Cubic Bipartite Graphs. Graphs Comb. 37 (5) (2021)
Robert E. L. Aldred, Michael D. Plummer, Watcharintorn Ruksasakchai
Distance restricted matching extension missing vertices and edges in 5-connected triangulations of the plane. J. Graph Theory 95 (2) (2020)
Adel Alahmadi, Robert E. L. Aldred, Carsten Thomassen
Cycles in 5-connected triangulations. J. Comb. Theory, Ser. B 140 (2020)
Robert E. L. Aldred, Michael D. Plummer
Extendability and Criticality in Matching Theory. Graphs Comb. 36 (3) (2020)
Robert E. L. Aldred, Jun Fujisawa, Akira Saito
Distance matching extension and local structure of graphs. J. Graph Theory 93 (1) (2020)
Robert E. L. Aldred, Michael D. Plummer, Watcharintorn Ruksasakchai
Restricted matching in plane triangulations and near triangulations. Discret. Appl. Math. 284 (2020)
Robert E. L. Aldred, Jun Fujisawa, Akira Saito
Pairs and triples of forbidden subgraphs and the existence of a 2-factor. J. Graph Theory 90 (1) (2019)
Robert E. L. Aldred, Jun Fujisawa, Akira Saito
Edge proximity and matching extension in punctured planar triangulations. Discret. Math. 340 (12) (2017)
Robert E. L. Aldred, Michael D. Plummer
Matching extension in prism graphs. Discret. Appl. Math. 221 (2017)
Bader F. AlBdaiwi, Zaid Hussain, Anton Cerný, Robert E. L. Aldred
Edge-disjoint node-independent spanning trees in dense Gaussian networks. J. Supercomput. 72 (12) (2016)
Bader F. AlBdaiwi, Zaid Hussain, Anton Cerný, Robert E. L. Aldred
Edge-Disjoint Node-Independent Spanning Trees in Dense Gaussian Networks. CoRR (2016)
Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Seongmin Ok, Patrick Solé, Carsten Thomassen
The minimum number of minimal codewords in an [n, k]-code and in graphic codes. Discret. Appl. Math. 184 (2015)
Robert E. L. Aldred, Qiuli Li, Michael D. Plummer, Dong Ye, Heping Zhang
Matching extension in toroidal quadrangulations II: the 3-extendable case. Australas. J Comb. 63 (2015)
Adel Alahmadi, Robert E. L. Aldred, Ahmad Alkenani, Rola Hijazi, Patrick Solé, Carsten Thomassen
Extending a perfect matching to a Hamiltonian cycle. Discret. Math. Theor. Comput. Sci. 17 (1) (2015)
Robert E. L. Aldred, Jun Fujisawa
Distance-Restricted Matching Extension in Triangulations of the Torus and the Klein Bottle. Electron. J. Comb. 21 (3) (2014)
Robert E. L. Aldred, Qiuli Li, Michael D. Plummer, Heping Zhang
Matching extension in quadrangulations of the torus. Australas. J Comb. 57 (2013)
Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen
The maximum number of minimal codewords in long codes. Discret. Appl. Math. 161 (3) (2013)
Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen
][n, k]-code. Discret. Math. 313 (15) (2013)
Robert E. L. Aldred, Michael D. Plummer
Graphs with the cycle extension property. Australas. J Comb. 52 (2012)
Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen
The maximum number of minimal codewords in an $[n,k]-$code CoRR (2012)
Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen
The maximum number of minimal codewords in long codes CoRR (2012)
Robert E. L. Aldred, Michael D. Plummer
Proximity thresholds for matching extension in the torus and Klein bottle. Discret. Appl. Math. 160 (7-8) (2012)
Robert E. L. Aldred, Michael D. Plummer
Proximity thresholds for matching extension in planar and projective planar triangulations. J. Graph Theory 67 (1) (2011)
Robert E. L. Aldred, Yoshimi Egawa, Jun Fujisawa, Katsuhiro Ota, Akira Saito
-free graphs with large connectivity and large edge-connectivity. J. Graph Theory 68 (1) (2011)
Watcharaphong Ananchuen, Nawarat Ananchuen, Robert E. L. Aldred
The structure of 4-gamma-critical graphs with a cut vertex. Discret. Math. 310 (17-18) (2010)
Robert E. L. Aldred, Jun Fujisawa, Akira Saito
Forbidden subgraphs and the existence of a 2-factor. J. Graph Theory 64 (3) (2010)
Robert E. L. Aldred, Michael D. Plummer
Distance-restricted matching extension in planar triangulations. Discret. Math. 310 (20) (2010)
Robert E. L. Aldred, Mike D. Atkinson, D. J. McCaughan
Avoiding consecutive patterns in permutations. Adv. Appl. Math. 45 (3) (2010)
Robert E. L. Aldred, Dries Van Dyck, Gunnar Brinkmann, Veerle Fack, Brendan D. McKay
Graph structural properties of non-Yutsis graphs allowing fast recognition. Discret. Appl. Math. 157 (2) (2009)
Robert E. L. Aldred, Jun Fujisawa, Akira Saito
Two forbidden subgraphs and the existence of a 2-factor in graphs. Australas. J Comb. 44 (2009)
Marién Abreu, Robert E. L. Aldred, Martin Funk, Bill Jackson, Domenico Labbate, John Sheehan
Corrigendum to "Graphs and digraphs with all 2-factors isomorphic" [J. Combin. Theory Ser. B 92 (2) (2004) 395-404]. J. Comb. Theory, Ser. B 99 (1) (2009)
Robert E. L. Aldred, Michael D. Plummer
Restricted matching in graphs of small genus. Discret. Math. 308 (24) (2008)
Robert E. L. Aldred, Carsten Thomassen
On the maximum number of cycles in a planar graph. J. Graph Theory 57 (3) (2008)
Robert E. L. Aldred, Ken-ichi Kawarabayashi, Michael D. Plummer
On the matching extendability of graphs in surfaces. J. Comb. Theory, Ser. B 98 (1) (2008)
Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley, Derek A. Holton, D. J. McCaughan
Compositions of pattern restricted sets of permutations. Australas. J Comb. 37 (2007)
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
Cyclically closed pattern classes of permutations. Australas. J Comb. 38 (2007)
Robert E. L. Aldred, Richard P. Anstee, Stephen C. Locke
Perfect matchings after vertex deletions. Discret. Math. 307 (23) (2007)
Robert E. L. Aldred, Bill Jackson
Edge proximity conditions for extendability in cubic bipartite graphs. J. Graph Theory 55 (2) (2007)
Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley
Safe communication for card players by combinatorial designs for two-step protocols. Australas. J Comb. 33 (2005)
Robert E. L. Aldred, Derek A. Holton, John Sheehan
2-factors with prescribed and proscribed edges. J. Graph Theory 49 (1) (2005)
Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Chris C. Handley, Derek A. Holton, D. J. McCaughan, Hans P. van Ditmarsch
Sorting Classes. Electron. J. Comb. 12 (2005)
Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley, Derek A. Holton, D. J. McCaughan
Permuting machines and priority queues. Theor. Comput. Sci. 349 (3) (2005)
Louigi Addario-Berry, Robert E. L. Aldred, Ketan Dalal, Bruce A. Reed
Vertex colouring edge partitions. J. Comb. Theory, Ser. B 94 (2) (2005)
Robert E. L. Aldred, Michael D. Plummer
Edge proximity and matching extension in planar triangulations. Australas. J Comb. 29 (2004)
Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley, Derek A. Holton
Restricted permutations and queue jumping. Discret. Math. 287 (1-3) (2004)
Robert E. L. Aldred, Carsten Thomassen
Graphs with not all possible path-kernels. Discret. Math. 285 (1-3) (2004)
Robert E. L. Aldred, Derek A. Holton, Dingjun Lou, Ning Zhong
-extendable graphs. Discret. Math. 287 (1-3) (2004)
Marién Abreu, Robert E. L. Aldred, Martin Funk, Bill Jackson, Domenico Labbate, John Sheehan
Graphs and digraphs with all 2-factors isomorphic. J. Comb. Theory, Ser. B 92 (2) (2004)
Robert E. L. Aldred, Martin Funk, Bill Jackson, Domenico Labbate, John Sheehan
Regular bipartite graphs with all 2-factors isomorphic. J. Comb. Theory, Ser. B 92 (1) (2004)
Robert E. L. Aldred, Derek A. Holton, Dingjun Lou, Akira Saito
-extendable bipartite graphs. Discret. Math. 269 (1-3) (2003)
Michael H. Albert, Robert E. L. Aldred, Michael D. Atkinson, Hans P. van Ditmarsch, B. D. Handley, Chris C. Handley, Jaroslav Opatrny
Longest subsequences in permutations. Australas. J Comb. 28 (2003)
Robert E. L. Aldred, Jozef Sirán, Martin Sirán
A note on the number of graceful labellings of paths. Discret. Math. 261 (1-3) (2003)
Michael H. Albert, Robert E. L. Aldred, Derek A. Holton
-connected graphs. Australas. J Comb. 24 (2001)
Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Chris C. Handley, Derek A. Holton
Permutations of a Multiset Avoiding Permutations of Length 3. Eur. J. Comb. 22 (8) (2001)
Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Derek A. Holton
Algorithms for Pattern Involvement in Permutations. ISAAC (2001)
Robert E. L. Aldred, Michael D. Plummer
On restricted matching extension in planar graphs. Discret. Math. 231 (1-3) (2001)
Robert E. L. Aldred, Sheng Bau, Derek A. Holton, Brendan D. McKay
Nonhamiltonian 3-Connected Cubic Planar Graphs. SIAM J. Discret. Math. 13 (1) (2000)
Derek A. Holton, Robert E. L. Aldred
Planar graphs, regular graphs, bipartite graphs and Hamiltonicity: Corrigendum. Australas. J Comb. 21 (2000)
Robert E. L. Aldred, Derek A. Holton, M. I. Porteous, Michael D. Plummer
Two results on matching extensions with prescribed and proscribed edge sets. Discret. Math. 206 (1-3) (1999)
Derek A. Holton, Robert E. L. Aldred
Planar graphs, regular graphs, bipartite graphs and Hamiltonicity. Australas. J Comb. 20 (1999)
Robert E. L. Aldred, Michael D. Plummer
On matching extensions with prescribed and proscribed edge sets II. Discret. Math. (1999)
Robert E. L. Aldred, Sheng Bau, Derek A. Holton, Brendan D. McKay
Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs. Graphs Comb. 15 (4) (1999)
Robert E. L. Aldred, Nicholas C. Wormald
More on the linear k-arboricity of regular graphs. Australas. J Comb. 18 (1998)
Robert E. L. Aldred, Carsten Thomassen
On the Number of Cycles in 3-Connected Cubic Graphs. J. Comb. Theory, Ser. B 71 (1) (1997)
Robert E. L. Aldred, Mark N. Ellingham, Robert L. Hemminger, Derek A. Holton
Cycles in quasi 4-connected graphs. Australas. J Comb. 15 (1997)
Robert E. L. Aldred, Mark N. Ellingham, Robert L. Hemminger, Peter Jipsen
-isomorphisms for graphs. J. Graph Theory 26 (1) (1997)
Robert E. L. Aldred, Chen Jian, Robert L. Hemminger
The 3-connected graphs with a longest path containing precisely two contractible edges. Australas. J Comb. 13 (1996)
M. I. Porteous, Robert E. L. Aldred
Matching extensions with prescribed and forbidden edges. Australas. J Comb. 13 (1996)
Robert E. L. Aldred, Robert L. Hemminger
On Hamilton cycles and contractible edges in 3-connected graphs. Australas. J Comb. 11 (1995)
Robert E. L. Aldred, Richard P. Anstee
On the density of sets of divisors. Discret. Math. 137 (1-3) (1995)
Robert E. L. Aldred, Derek A. Holton, Zang Ke Min
A degree characterisation of pancyclicity. Discret. Math. 127 (1-3) (1994)
Robert E. L. Aldred, Robert L. Hemminger, Katsuhiro Ota
The 3-connected graphs having a longest cycle containing only three contractible edges. J. Graph Theory 17 (3) (1993)
Robert E. L. Aldred, Derek A. Holton, Dingjun Lou
N-extendability of symmetric graphs. J. Graph Theory 17 (2) (1993)
Robert E. L. Aldred
Note on distance-regular graphs with a pair of equal subdegrees. Australas. J Comb. 6 (1992)
Robert E. L. Aldred, Robert L. Hemminger, Xingxing Yu
Maximum matchings in 3-connected graphs contain contractible edges. Australas. J Comb. 6 (1992)
Robert E. L. Aldred, Bill Jackson, Dingjun Lou, Akira Saito
Partitioning regular graphs into equicardinal linear forests. Discret. Math. 88 (1) (1991)
Robert E. L. Aldred, Derek A. Holton, Bill Jackson
Uniform cyclic edge connectivity in cubic graphs. Comb. 11 (2) (1991)
Robert E. L. Aldred, Chris D. Godsil
Distance-regular antipodai covering graphs. J. Comb. Theory, Ser. B 45 (2) (1988)
Robert E. L. Aldred, Sheng Bau, Derek A. Holton, Gordon F. Royle
An 11-vertex theorem for 3-connected cubic graphs. J. Graph Theory 12 (4) (1988)
Robert E. L. Aldred, Derek A. Holton
Cycles through five edges in 3-connected cubic graphs. Graphs Comb. 3 (1) (1987)
Robert E. L. Aldred, Derek A. Holton, Carsten Thomassen
Cycles through four edges in 3-connected cubic graphs. Graphs Comb. 1 (1) (1985)