default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert E. L. Aldred
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2023
[j80]Robert E. L. Aldred
, Jun Fujisawa:
Removal of subgraphs and perfect matchings in graphs on surfaces. J. Graph Theory 102(2): 304-321 (2023)- [j79]Robert E. L. Aldred, Bill Jackson, Michael D. Plummer:
Edge proximity conditions for extendability in regular bipartite graphs. J. Graph Theory 104(2): 282-288 (2023) - 2021
- [j78]Robert E. L. Aldred, Michael D. Plummer, Watcharintorn Ruksasakchai:
Asymmetric distance matching extension. Australas. J Comb. 79: 1-14 (2021) - [j77]Robert E. L. Aldred, Jun Fujisawa, Akira Saito:
Distance Matching Extension in Cubic Bipartite Graphs. Graphs Comb. 37(5): 1793-1806 (2021) - 2020
- [j76]Robert E. L. Aldred, Michael D. Plummer, Watcharintorn Ruksasakchai:
Restricted matching in plane triangulations and near triangulations. Discret. Appl. Math. 284: 251-261 (2020) - [j75]Robert E. L. Aldred, Michael D. Plummer:
Extendability and Criticality in Matching Theory. Graphs Comb. 36(3): 573-589 (2020) - [j74]Adel Alahmadi, Robert E. L. Aldred, Carsten Thomassen:
Cycles in 5-connected triangulations. J. Comb. Theory, Ser. B 140: 27-44 (2020) - [j73]Robert E. L. Aldred, Jun Fujisawa, Akira Saito:
Distance matching extension and local structure of graphs. J. Graph Theory 93(1): 5-20 (2020) - [j72]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): 240-255 (2020) - 2019
- [j71]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): 61-82 (2019) - 2017
- [j70]Robert E. L. Aldred, Michael D. Plummer:
Matching extension in prism graphs. Discret. Appl. Math. 221: 25-32 (2017) - [j69]Robert E. L. Aldred, Jun Fujisawa, Akira Saito:
Edge proximity and matching extension in punctured planar triangulations. Discret. Math. 340(12): 2978-2985 (2017) - 2016
- [j68]Bader F. AlBdaiwi, Zaid A. Hussain, Anton Cerný, Robert E. L. Aldred:
Edge-disjoint node-independent spanning trees in dense Gaussian networks. J. Supercomput. 72(12): 4718-4736 (2016) - 2015
- [j67]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: 268-296 (2015) - [j66]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: 32-39 (2015) - [j65]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): 241-254 (2015) - 2014
- [j64]Robert E. L. Aldred, Jun Fujisawa:
Distance-Restricted Matching Extension in Triangulations of the Torus and the Klein Bottle. Electron. J. Comb. 21(3): 3 (2014) - 2013
- [j63]Robert E. L. Aldred, Qiuli Li, Michael D. Plummer, Heping Zhang:
Matching extension in quadrangulations of the torus. Australas. J Comb. 57: 217-234 (2013) - [j62]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): 424-429 (2013) - [j61]Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen:
The maximum number of minimal codewords in an [n, k][n, k]-code. Discret. Math. 313(15): 1569-1574 (2013) - 2012
- [j60]Robert E. L. Aldred, Michael D. Plummer:
Graphs with the cycle extension property. Australas. J Comb. 52: 293- (2012) - [j59]Robert E. L. Aldred, Michael D. Plummer:
Proximity thresholds for matching extension in the torus and Klein bottle. Discret. Appl. Math. 160(7-8): 985-991 (2012) - 2011
- [j58]Robert E. L. Aldred, Michael D. Plummer:
Proximity thresholds for matching extension in planar and projective planar triangulations. J. Graph Theory 67(1): 38-46 (2011) - [j57]Robert 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. J. Graph Theory 68(1): 77-89 (2011) - 2010
- [j56]Robert E. L. Aldred, Mike D. Atkinson, D. J. McCaughan:
Avoiding consecutive patterns in permutations. Adv. Appl. Math. 45(3): 449-461 (2010) - [j55]Watcharaphong Ananchuen, Nawarat Ananchuen, Robert E. L. Aldred:
The structure of 4-gamma-critical graphs with a cut vertex. Discret. Math. 310(17-18): 2404-2414 (2010) - [j54]Robert E. L. Aldred, Michael D. Plummer:
Distance-restricted matching extension in planar triangulations. Discret. Math. 310(20): 2618-2636 (2010) - [j53]Robert E. L. Aldred, Jun Fujisawa, Akira Saito:
Forbidden subgraphs and the existence of a 2-factor. J. Graph Theory 64(3): 250-266 (2010) - 2009
- [j52]Robert E. L. Aldred, Jun Fujisawa, Akira Saito:
Two forbidden subgraphs and the existence of a 2-factor in graphs. Australas. J Comb. 44: 235-246 (2009) - [j51]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): 377-386 (2009) - [j50]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 B 99(1): 271-273 (2009) - 2008
- [j49]Robert E. L. Aldred, Michael D. Plummer:
Restricted matching in graphs of small genus. Discret. Math. 308(24): 5907-5921 (2008) - [j48]Robert E. L. Aldred, Ken-ichi Kawarabayashi, Michael D. Plummer:
On the matching extendability of graphs in surfaces. J. Comb. Theory B 98(1): 105-115 (2008) - [j47]Robert E. L. Aldred, Carsten Thomassen:
On the maximum number of cycles in a planar graph. J. Graph Theory 57(3): 255-264 (2008) - 2007
- [j46]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: 43-56 (2007) - [j45]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: 87-100 (2007) - [j44]Robert E. L. Aldred, Richard P. Anstee, Stephen C. Locke:
Perfect matchings after vertex deletions. Discret. Math. 307(23): 3048-3054 (2007) - [j43]Robert E. L. Aldred, Bill Jackson:
Edge proximity conditions for extendability in cubic bipartite graphs. J. Graph Theory 55(2): 112-120 (2007) - 2005
- [j42]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: 33-46 (2005) - [j41]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) - [j40]Louigi Addario-Berry, Robert E. L. Aldred, Ketan Dalal, Bruce A. Reed:
Vertex colouring edge partitions. J. Comb. Theory B 94(2): 237-244 (2005) - [j39]Robert E. L. Aldred, Derek A. Holton, John Sheehan:
2-factors with prescribed and proscribed edges. J. Graph Theory 49(1): 48-58 (2005) - [j38]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
- [j37]Robert E. L. Aldred, Michael D. Plummer:
Edge proximity and matching extension in planar triangulations. Australas. J Comb. 29: 215-224 (2004) - [j36]Robert E. L. Aldred, Carsten Thomassen:
Graphs with not all possible path-kernels. Discret. Math. 285(1-3): 297-300 (2004) - [j35]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): 129-133 (2004) - [j34]Robert E. L. Aldred, Derek A. Holton, Dingjun Lou, Ning Zhong:
Characterizing 2k-critical graphs and n-extendable graphs. Discret. Math. 287(1-3): 135-139 (2004) - [j33]Robert E. L. Aldred, Martin Funk, Bill Jackson, Domenico Labbate, John Sheehan:
Regular bipartite graphs with all 2-factors isomorphic. J. Comb. Theory B 92(1): 151-161 (2004) - [j32]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 B 92(2): 395-404 (2004) - 2003
- [j31]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: 225-238 (2003) - [j30]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): 27-30 (2003) - [j29]Robert E. L. Aldred, Derek A. Holton, Dingjun Lou, Akira Saito:
M-alternating paths in n-extendable bipartite graphs. Discret. Math. 269(1-3): 1-11 (2003) - 2001
- [j28]Michael H. Albert, Robert E. L. Aldred, Derek A. Holton:
On 3*-connected graphs. Australas. J Comb. 24: 193-208 (2001) - [j27]Robert E. L. Aldred, Michael D. Plummer:
On restricted matching extension in planar graphs. Discret. Math. 231(1-3): 73-79 (2001) - [j26]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
- [j25]Derek A. Holton, Robert E. L. Aldred:
Planar graphs, regular graphs, bipartite graphs and Hamiltonicity: Corrigendum. Australas. J Comb. 21: 311- (2000) - [j24]Robert E. L. Aldred, Sheng Bau, Derek A. Holton, Brendan D. McKay:
Nonhamiltonian 3-Connected Cubic Planar Graphs. SIAM J. Discret. Math. 13(1): 25-32 (2000) - 1999
- [j23]Derek A. Holton, Robert E. L. Aldred:
Planar graphs, regular graphs, bipartite graphs and Hamiltonicity. Australas. J Comb. 20: 111-132 (1999) - [j22]Robert E. L. Aldred, Michael D. Plummer:
On matching extensions with prescribed and proscribed edge sets II. Discret. Math. 197-198: 29-40 (1999) - [j21]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): 35-43 (1999) - [j20]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): 373-376 (1999) - 1998
- [j19]Robert E. L. Aldred, Nicholas C. Wormald:
More on the linear k-arboricity of regular graphs. Australas. J Comb. 18: 97-104 (1998) - 1997
- [j18]Robert E. L. Aldred, Mark N. Ellingham, Robert L. Hemminger, Derek A. Holton:
Cycles in quasi 4-connected graphs. Australas. J Comb. 15: 37-46 (1997) - [j17]Robert E. L. Aldred, Carsten Thomassen:
On the Number of Cycles in 3-Connected Cubic Graphs. J. Comb. Theory B 71(1): 79-84 (1997) - [j16]Robert E. L. Aldred, Mark N. Ellingham, Robert L. Hemminger, Peter Jipsen:
P3-isomorphisms for graphs. J. Graph Theory 26(1): 35-51 (1997) - 1996
- [j15]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: 3-14 (1996) - [j14]M. I. Porteous, Robert E. L. Aldred:
Matching extensions with prescribed and forbidden edges. Australas. J Comb. 13: 163-174 (1996) - 1995
- [j13]Robert E. L. Aldred, Robert L. Hemminger:
On Hamilton cycles and contractible edges in 3-connected graphs. Australas. J Comb. 11: 3-24 (1995) - [j12]Robert E. L. Aldred, Richard P. Anstee:
On the density of sets of divisors. Discret. Math. 137(1-3): 345-349 (1995) - 1994
- [j11]Robert E. L. Aldred, Derek A. Holton, Zang Ke Min:
A degree characterisation of pancyclicity. Discret. Math. 127(1-3): 23-29 (1994) - 1993
- [j10]Robert E. L. Aldred, Derek A. Holton, Dingjun Lou:
N-extendability of symmetric graphs. J. Graph Theory 17(2): 253-261 (1993) - [j9]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): 361-371 (1993) - 1992
- [j8]Robert E. L. Aldred, Robert L. Hemminger, Xingxing Yu:
Maximum matchings in 3-connected graphs contain contractible edges. Australas. J Comb. 6: 23-34 (1992) - [j7]Robert E. L. Aldred:
Note on distance-regular graphs with a pair of equal subdegrees. Australas. J Comb. 6: 35-38 (1992) - 1991
- [j6]Robert E. L. Aldred, Derek A. Holton, Bill Jackson:
Uniform cyclic edge connectivity in cubic graphs. Comb. 11(2): 81-96 (1991) - [j5]Robert E. L. Aldred, Bill Jackson, Dingjun Lou, Akira Saito:
Partitioning regular graphs into equicardinal linear forests. Discret. Math. 88(1): 1-9 (1991) - 1988
- [j4]Robert E. L. Aldred, Chris D. Godsil:
Distance-regular antipodai covering graphs. J. Comb. Theory B 45(2): 127-134 (1988) - [j3]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): 561-570 (1988) - 1987
- [j2]Robert E. L. Aldred, Derek A. Holton:
Cycles through five edges in 3-connected cubic graphs. Graphs Comb. 3(1): 299-311 (1987) - 1985
- [j1]Robert E. L. Aldred, Derek A. Holton, Carsten Thomassen:
Cycles through four edges in 3-connected cubic graphs. Graphs Comb. 1(1): 7-11 (1985)
Conference and Workshop Papers
- 2001
- [c1]Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Derek A. Holton:
Algorithms for Pattern Involvement in Permutations. ISAAC 2001: 355-366
Informal and Other Publications
- 2016
- [i3]Bader F. AlBdaiwi, Zaid A. Hussain, Anton Cerný, Robert E. L. Aldred:
Edge-Disjoint Node-Independent Spanning Trees in Dense Gaussian Networks. CoRR abs/1601.06915 (2016) - 2012
- [i2]Adel 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) - [i1]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 abs/1203.0728 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
