Robert E. L. Aldred

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