dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Robert E. L. Aldred Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAdel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen: The maximum number of minimal codewords in long codes CoRR abs/1201.6043: (2012)
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAdel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen: The maximum number of minimal codewords in an $[n,k]-$code CoRR abs/1203.0728: (2012)
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert E. L. Aldred, Michael D. Plummer: Proximity thresholds for matching extension in the torus and Klein bottle. Discrete Applied Mathematics 160(7-8): 985-991 (2012)
2011
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert E. L. Aldred, Michael D. Plummer: Proximity thresholds for matching extension in planar and projective planar triangulations. Journal of Graph Theory 67(1): 38-46 (2011)
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert E. L. Aldred, Yoshimi Egawa, Jun Fujisawa, Katsuhiro Ota, Akira Saito: The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity. Journal of Graph Theory 68(1): 77-89 (2011)
2010
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWatcharaphong Ananchuen, Nawarat Ananchuen, Robert E. L. Aldred: The structure of 4-gamma-critical graphs with a cut vertex. Discrete Mathematics 310(17-18): 2404-2414 (2010)
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert E. L. Aldred, Michael D. Plummer: Distance-restricted matching extension in planar triangulations. Discrete Mathematics 310(20): 2618-2636 (2010)
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert E. L. Aldred, Jun Fujisawa, Akira Saito: Forbidden subgraphs and the existence of a 2-factor. Journal of Graph Theory 64(3): 250-266 (2010)
2009
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert 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)
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarien 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
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert E. L. Aldred, Michael D. Plummer: Restricted matching in graphs of small genus. Discrete Mathematics 308(24): 5907-5921 (2008)
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert 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)
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert 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
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert E. L. Aldred, Richard P. Anstee, Stephen C. Locke: Perfect matchings after vertex deletions. Discrete Mathematics 307(23): 3048-3054 (2007)
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert E. L. Aldred, Bill Jackson: Edge proximity conditions for extendability in cubic bipartite graphs. Journal of Graph Theory 55(2): 112-120 (2007)
2005
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLouigi 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)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert E. L. Aldred, Derek A. Holton, John Sheehan: 2-factors with prescribed and proscribed edges. Journal of Graph Theory 49(1): 48-58 (2005)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert 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
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert E. L. Aldred, Carsten Thomassen: Graphs with not all possible path-kernels. Discrete Mathematics 285(1-3): 297-300 (2004)
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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)
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert 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)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert 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)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarien 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
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert 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)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert 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
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Derek A. Holton: Algorithms for Pattern Involvement in Permutations. ISAAC 2001: 355-366
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert E. L. Aldred, Michael D. Plummer: On restricted matching extension in planar graphs. Discrete Mathematics 231(1-3): 73-79 (2001)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert 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
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert E. L. Aldred, Michael D. Plummer: On matching extensions with prescribed and proscribed edge sets II. Discrete Mathematics 197-198: 29-40 (1999)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert 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)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert E. L. Aldred, S. Bau, Derek A. Holton, Brendan D. McKay: Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs. Graphs and Combinatorics 15(4): 373-376 (1999)
1997
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert 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
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert E. L. Aldred, Richard P. Anstee: On the density of sets of divisors. Discrete Mathematics 137(1-3): 345-349 (1995)
1994
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert E. L. Aldred, Derek A. Holton, Zang Ke Min: A degree characterisation of pancyclicity. Discrete Mathematics 127(1-3): 23-29 (1994)
1991
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert E. L. Aldred, Derek A. Holton, Bill Jackson: Uniform cyclic edge connectivity in cubic graphs. Combinatorica 11(2): 81-96 (1991)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert E. L. Aldred, Bill Jackson, Dingjun Lou, Akira Saito: Partitioning regular graphs into equicardinal linear forests. Discrete Mathematics 88(1): 1-9 (1991)
1988
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert E. L. Aldred, Chris D. Godsil: Distance-regular antipodai covering graphs. J. Comb. Theory, Ser. B 45(2): 127-134 (1988)
1987
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert E. L. Aldred, Derek A. Holton: Cycles through five edges in 3-connected cubic graphs. Graphs and Combinatorics 3(1): 299-311 (1987)
1985
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert E. L. Aldred, Derek A. Holton, Carsten Thomassen: Cycles through four edges in 3-connected cubic graphs. Graphs and Combinatorics 1(1): 7-11 (1985)

Coauthor Index

1Marien Abreu [18] [32]
2Louigi Addario-Berry [25]
3Adel Alahmadi [40] [41]
4Michael H. Albert (Michael Henry Albert) [13] [15] [21] [26]
5Nawarat Ananchuen [36]
6Watcharaphong Ananchuen [36]
7Richard P. Anstee [7] [28]
8Mike D. Atkinson (M. D. Atkinson) [13] [15] [21] [23] [26]
9S. Bau [9] [12]
10Gunnar Brinkmann [33]
11Romar dela Cruz [40] [41]
12Ketan Dalal [25]
13Hans P. van Ditmarsch [21] [23] [26]
14Dries Van Dyck [33]
15Yoshimi Egawa [37]
16Veerle Fack [33]
17Jun Fujisawa [34] [37]
18Martin Funk [18] [19] [32]
19Chris D. Godsil (C. D. Godsil) [3]
20Chris C. Handley [13] [21] [23] [26]
21Derek A. Holton [1] [2] [5] [6] [9] [10] [12] [13] [15] [16] [20] [21] [23] [24] [26]
22Bill Jackson [4] [5] [18] [19] [27] [32]
23Ken-ichi Kawarabayashi [30]
24Domenico Labbate [18] [19] [32]
25Stephen C. Locke [28]
26Dingjun Lou [4] [16] [20]
27D. J. McCaughan [23] [26]
28Brendan D. McKay [9] [12] [33]
29Zang Ke Min [6]
30Katsuhiro Ota [37]
31Michael D. Plummer [10] [11] [14] [30] [31] [35] [38] [39]
32M. I. Porteous [10]
33Bruce A. Reed [25]
34Akira Saito [4] [16] [34] [37]
35John Sheehan [18] [19] [24] [32]
36Jozef Sirán [17]
37Martin Sirán [17]
38Patrick Solé [40] [41]
39Carsten Thomassen [1] [8] [22] [29] [40] [41]
40Ning Zhong [20]

Last update Sat May 26 04:23:17 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page