The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Derek A. Holton: [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. Mark N. Ellingham, Derek A. Holton, Charles H. C. Little
    Cycles through ten vertices in 3-connected cubic graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:4, pp:265-273 [Journal]
  4. Derek A. Holton, Charles H. C. Little
    Regular odd rings and non-planar graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1982, v:2, n:2, pp:149-152 [Journal]
  5. Derek A. Holton, Brendan D. McKay, Michael D. Plummer, Carsten Thomassen
    A nine point theorem for 3-connected graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1982, v:2, n:1, pp:53-62 [Journal]
  6. Michael H. Albert, Mike D. Atkinson, Chris C. Handley, Derek A. Holton, Walter Stromquist
    On Packing Densities of Permutations. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal]
  7. 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]
  8. Michael H. Albert, Derek A. Holton, Richard J. Nowakowski
    The ultimate categorical matching in a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:232, n:1-3, pp:1-9 [Journal]
  9. 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]
  10. 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]
  11. Shannon L. Fitzpatrick, Richard J. Nowakowski, Derek A. Holton, Ian Caines
    Covering hypercubes by isometric paths. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:253-260 [Journal]
  12. 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]
  13. Kian-Sam Hong, Kwok-Wing Lai, Derek A. Holton
    Students' Satisfaction and Perceived Learning with a Web-based Course. [Citation Graph (0, 0)][DBLP]
    Educational Technology & Society, 2003, v:6, n:1, pp:- [Journal]
  14. Derek A. Holton, Brendan D. McKay
    The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:45, n:3, pp:305-319 [Journal]
  15. Derek A. Holton, Bennet Manvel, Brendan D. McKay
    Hamiltonian cycles in cubic 3-connected bipartite planar graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:3, pp:279-297 [Journal]
  16. Charles H. C. Little, Derek A. Holton
    No graph has a maximal 3-ring of bonds. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:2, pp:139-142 [Journal]
  17. Julie Sims, Derek A. Holton
    Stability of cartesian products. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1978, v:25, n:3, pp:258-282 [Journal]
  18. K. C. Stacey, Derek A. Holton
    On the automorphism group of a tree. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1977, v:22, n:1, pp:10-25 [Journal]
  19. 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]
  20. 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]
  21. 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]
  22. 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]
  23. Derek A. Holton, Dingjun Lou, Michael D. Plummer
    On the 2-extendability of planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:96, n:2, pp:81-99 [Journal]
  24. Dingjun Lou, Derek A. Holton
    Lower bound of cyclic edge connectivity for n-extendability of regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:112, n:1-3, pp:139-150 [Journal]
  25. 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]

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


Search in 0.047secs, Finished in 0.048secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002