The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Robert E. L. Aldred: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Derek A. Holton
    Algorithms for Pattern Involvement in Permutations. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:355-366 [Conf]
  2. Robert E. L. Aldred, Derek A. Holton, Bill Jackson
    Uniform cyclic edge connectivity in cubic graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:2, pp:81-96 [Journal]
  3. Robert E. L. Aldred, Carsten Thomassen
    Graphs with not all possible path-kernels. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:297-300 [Journal]
  4. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:129-133 [Journal]
  5. Robert E. L. Aldred, Derek A. Holton, Dingjun Lou, Akira Saito
    M-alternating paths in n-extendable bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:1-11 [Journal]
  6. Robert E. L. Aldred, Derek A. Holton, Dingjun Lou, Ning Zhong
    Characterizing 2k-critical graphs and n-extendable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:135-139 [Journal]
  7. Robert E. L. Aldred, Michael D. Plummer
    On restricted matching extension in planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:231, n:1-3, pp:73-79 [Journal]
  8. Robert E. L. Aldred, Jozef Sirán, Martin Sirán
    A note on the number of graceful labellings of paths. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:27-30 [Journal]
  9. 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. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2001, v:22, n:8, pp:1021-1031 [Journal]
  10. Martin Abreu, Robert E. L. Aldred, Martin Funk, Bill Jackson, Domenico Labbate, John Sheehan
    Graphs and digraphs with all 2-factors isomorphic. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:92, n:2, pp:395-404 [Journal]
  11. Louigi Addario-Berry, Robert E. L. Aldred, Ketan Dalal, Bruce A. Reed
    Vertex colouring edge partitions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:94, n:2, pp:237-244 [Journal]
  12. Robert E. L. Aldred, Martin Funk, Bill Jackson, Domenico Labbate, John Sheehan
    Regular bipartite graphs with all 2-factors isomorphic. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:92, n:1, pp:151-161 [Journal]
  13. Robert E. L. Aldred, Chris D. Godsil
    Distance-regular antipodai covering graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:45, n:2, pp:127-134 [Journal]
  14. Robert E. L. Aldred, Carsten Thomassen
    On the Number of Cycles in 3-Connected Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:71, n:1, pp:79-84 [Journal]
  15. Robert E. L. Aldred, S. Bau, Derek A. Holton, Brendan D. McKay
    Nonhamiltonian 3-Connected Cubic Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:1, pp:25-32 [Journal]
  16. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:3, pp:309-317 [Journal]
  17. Robert E. L. Aldred, Derek A. Holton, John Sheehan
    2-factors with prescribed and proscribed edges. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:49, n:1, pp:48-58 [Journal]
  18. Robert E. L. Aldred, Derek A. Holton, M. I. Porteous, Michael D. Plummer
    Two results on matching extensions with prescribed and proscribed edge sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:206, n:1-3, pp:35-43 [Journal]
  19. Robert E. L. Aldred, Michael D. Plummer
    On matching extensions with prescribed and proscribed edge sets II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:29-40 [Journal]
  20. Robert E. L. Aldred, Bill Jackson, Dingjun Lou, Akira Saito
    Partitioning regular graphs into equicardinal linear forests. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:1, pp:1-9 [Journal]
  21. Robert E. L. Aldred, Richard P. Anstee
    On the density of sets of divisors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:137, n:1-3, pp:345-349 [Journal]
  22. Robert E. L. Aldred, Derek A. Holton, Zang Ke Min
    A degree characterisation of pancyclicity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:127, n:1-3, pp:23-29 [Journal]

  23. Sorting Classes. [Citation Graph (, )][DBLP]


  24. Graph structural properties of non-Yutsis graphs allowing fast recognition. [Citation Graph (, )][DBLP]


  25. Perfect matchings after vertex deletions. [Citation Graph (, )][DBLP]


  26. Restricted matching in graphs of small genus. [Citation Graph (, )][DBLP]


  27. The structure of 4-gamma-critical graphs with a cut vertex. [Citation Graph (, )][DBLP]


  28. Distance-restricted matching extension in planar triangulations. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002