2009 |
30 | EE | Robert E. L. Aldred,
Dries Van Dyck,
Gunnar Brinkmann,
Veerle Fack,
Brendan D. McKay:
Graph structural properties of non-Yutsis graphs allowing fast recognition.
Discrete Applied Mathematics 157(2): 377-386 (2009) |
29 | EE | Marien 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): 271-273 (2009) |
2008 |
28 | EE | Robert E. L. Aldred,
Michael D. Plummer:
Restricted matching in graphs of small genus.
Discrete Mathematics 308(24): 5907-5921 (2008) |
27 | EE | 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): 105-115 (2008) |
26 | EE | Robert E. L. Aldred,
Carsten Thomassen:
On the maximum number of cycles in a planar graph.
Journal of Graph Theory 57(3): 255-264 (2008) |
2007 |
25 | EE | Robert E. L. Aldred,
Richard P. Anstee,
Stephen C. Locke:
Perfect matchings after vertex deletions.
Discrete Mathematics 307(23): 3048-3054 (2007) |
24 | EE | Robert E. L. Aldred,
Bill Jackson:
Edge proximity conditions for extendability in cubic bipartite graphs.
Journal of Graph Theory 55(2): 112-120 (2007) |
2005 |
23 | EE | 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.
Electr. J. Comb. 12: (2005) |
22 | EE | Louigi Addario-Berry,
Robert E. L. Aldred,
Ketan Dalal,
Bruce A. Reed:
Vertex colouring edge partitions.
J. Comb. Theory, Ser. B 94(2): 237-244 (2005) |
21 | EE | Robert E. L. Aldred,
Derek A. Holton,
John Sheehan:
2-factors with prescribed and proscribed edges.
Journal of Graph Theory 49(1): 48-58 (2005) |
20 | EE | 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): 309-317 (2005) |
2004 |
19 | EE | Robert E. L. Aldred,
Carsten Thomassen:
Graphs with not all possible path-kernels.
Discrete Mathematics 285(1-3): 297-300 (2004) |
18 | EE | 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.
Discrete Mathematics 287(1-3): 129-133 (2004) |
17 | EE | Robert E. L. Aldred,
Derek A. Holton,
Dingjun Lou,
Ning Zhong:
Characterizing 2k-critical graphs and n-extendable graphs.
Discrete Mathematics 287(1-3): 135-139 (2004) |
16 | EE | 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): 151-161 (2004) |
15 | EE | Marien 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): 395-404 (2004) |
2003 |
14 | EE | Robert E. L. Aldred,
Jozef Sirán,
Martin Sirán:
A note on the number of graceful labellings of paths.
Discrete Mathematics 261(1-3): 27-30 (2003) |
13 | EE | Robert E. L. Aldred,
Derek A. Holton,
Dingjun Lou,
Akira Saito:
M-alternating paths in n-extendable bipartite graphs.
Discrete Mathematics 269(1-3): 1-11 (2003) |
2001 |
12 | EE | Michael H. Albert,
Robert E. L. Aldred,
Mike D. Atkinson,
Derek A. Holton:
Algorithms for Pattern Involvement in Permutations.
ISAAC 2001: 355-366 |
11 | EE | Robert E. L. Aldred,
Michael D. Plummer:
On restricted matching extension in planar graphs.
Discrete Mathematics 231(1-3): 73-79 (2001) |
10 | EE | 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): 1021-1031 (2001) |
2000 |
9 | EE | Robert E. L. Aldred,
S. Bau,
Derek A. Holton,
Brendan D. McKay:
Nonhamiltonian 3-Connected Cubic Planar Graphs.
SIAM J. Discrete Math. 13(1): 25-32 (2000) |
1999 |
8 | EE | Robert E. L. Aldred,
Michael D. Plummer:
On matching extensions with prescribed and proscribed edge sets II.
Discrete Mathematics 197-198: 29-40 (1999) |
7 | EE | Robert E. L. Aldred,
Derek A. Holton,
M. I. Porteous,
Michael D. Plummer:
Two results on matching extensions with prescribed and proscribed edge sets.
Discrete Mathematics 206(1-3): 35-43 (1999) |
1997 |
6 | EE | Robert E. L. Aldred,
Carsten Thomassen:
On the Number of Cycles in 3-Connected Cubic Graphs.
J. Comb. Theory, Ser. B 71(1): 79-84 (1997) |
1995 |
5 | EE | Robert E. L. Aldred,
Richard P. Anstee:
On the density of sets of divisors.
Discrete Mathematics 137(1-3): 345-349 (1995) |
1994 |
4 | EE | Robert E. L. Aldred,
Derek A. Holton,
Zang Ke Min:
A degree characterisation of pancyclicity.
Discrete Mathematics 127(1-3): 23-29 (1994) |
1991 |
3 | | Robert E. L. Aldred,
Derek A. Holton,
Bill Jackson:
Uniform cyclic edge connectivity in cubic graphs.
Combinatorica 11(2): 81-96 (1991) |
2 | EE | Robert E. L. Aldred,
Bill Jackson,
Dingjun Lou,
Akira Saito:
Partitioning regular graphs into equicardinal linear forests.
Discrete Mathematics 88(1): 1-9 (1991) |
1988 |
1 | EE | Robert E. L. Aldred,
Chris D. Godsil:
Distance-regular antipodai covering graphs.
J. Comb. Theory, Ser. B 45(2): 127-134 (1988) |