default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDerek A. Holton
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j44]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)- [j43]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) - 2005
- [j42]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) - [j41]Robert E. L. Aldred, Derek A. Holton, John Sheehan:
2-factors with prescribed and proscribed edges. J. Graph Theory 49(1): 48-58 (2005) - [j40]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
- [j39]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) - [j38]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) - 2003
- [j37]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) - [j36]Kian-Sam Hong, Kwok-Wing Lai, Derek A. Holton:
Students' Satisfaction and Perceived Learning with a Web-based Course. J. Educ. Technol. Soc. 6(1) (2003) - 2002
- [j35]Michael H. Albert, Mike D. Atkinson, Chris C. Handley, Derek A. Holton, Walter Stromquist:
On Packing Densities of Permutations. Electron. J. Comb. 9(1) (2002) - 2001
- [j34]Michael H. Albert, Robert E. L. Aldred, Derek A. Holton:
On 3*-connected graphs. Australas. J Comb. 24: 193-208 (2001) - [j33]Michael H. Albert, Derek A. Holton, Richard J. Nowakowski
:
The ultimate categorical matching in a graph. Discret. Math. 232(1-3): 1-9 (2001) - [j32]Shannon L. Fitzpatrick, Richard J. Nowakowski, Derek A. Holton, Ian Caines:
Covering hypercubes by isometric paths. Discret. Math. 240(1-3): 253-260 (2001) - [j31]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) - [c1]Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Derek A. Holton:
Algorithms for Pattern Involvement in Permutations. ISAAC 2001: 355-366 - 2000
- [j30]Derek A. Holton, Robert E. L. Aldred:
Planar graphs, regular graphs, bipartite graphs and Hamiltonicity: Corrigendum. Australas. J Comb. 21: 311- (2000) - [j29]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)
1990 – 1999
- 1999
- [j28]Derek A. Holton, Robert E. L. Aldred:
Planar graphs, regular graphs, bipartite graphs and Hamiltonicity. Australas. J Comb. 20: 111-132 (1999) - [j27]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) - [j26]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) - 1997
- [j25]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) - 1995
- [j24]Derek A. Holton, Dingjun Lou, K. L. McAvaney:
n-extendability of line graphs, power graphs, and total graphs. Australas. J Comb. 11: 215-222 (1995) - 1994
- [j23]Robert E. L. Aldred, Derek A. Holton, Zang Ke Min:
A degree characterisation of pancyclicity. Discret. Math. 127(1-3): 23-29 (1994) - 1993
- [b1]Derek A. Holton, John Sheehan:
The Petersen graph. Australian mathematical society lecture series 7, Cambridge University Press 1993, ISBN 978-0-521-43594-9, pp. 1-353 - [j22]Dingjun Lou, Derek A. Holton:
Lower bound of cyclic edge connectivity for n-extendability of regular graphs. Discret. Math. 112(1-3): 139-150 (1993) - [j21]Robert E. L. Aldred, Derek A. Holton, Dingjun Lou:
N-extendability of symmetric graphs. J. Graph Theory 17(2): 253-261 (1993) - 1992
- [j20]Roger B. Eggleton, Derek A. Holton, Charles H. C. Little:
Cycles and paths in multigraphs. Australas. J Comb. 5: 3-12 (1992) - [j19]Derek A. Holton, Dingjun Lou:
Matching extensions of strongly regular graphs. Australas. J Comb. 6: 187-208 (1992) - 1991
- [j18]Robert E. L. Aldred, Derek A. Holton, Bill Jackson:
Uniform cyclic edge connectivity in cubic graphs. Comb. 11(2): 81-96 (1991) - [j17]Derek A. Holton, Dingjun Lou, Michael D. Plummer:
On the 2-extendability of planar graphs. Discret. Math. 96(2): 81-99 (1991) - [j16]Sheng Bau, Derek A. Holton:
Cycles containing 12 vertices in 3-connected cubic graphs. J. Graph Theory 15(4): 421-429 (1991) - 1990
- [j15]Derek A. Holton, Bill Jackson, Akira Saito, Nicholas C. Wormald:
Removable edges in 3-connected graphs. J. Graph Theory 14(4): 465-473 (1990)
1980 – 1989
- 1988
- [j14]Derek A. Holton, Brendan D. McKay:
The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices. J. Comb. Theory B 45(3): 305-319 (1988) - [j13]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
- [j12]Robert E. L. Aldred, Derek A. Holton:
Cycles through five edges in 3-connected cubic graphs. Graphs Comb. 3(1): 299-311 (1987) - 1985
- [j11]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) - [j10]Charles H. C. Little, Derek A. Holton:
No graph has a maximal 3-ring of bonds. J. Comb. Theory B 38(2): 139-142 (1985) - [j9]Derek A. Holton, Bennet Manvel, Brendan D. McKay:
Hamiltonian cycles in cubic 3-connected bipartite planar graphs. J. Comb. Theory B 38(3): 279-297 (1985) - 1984
- [j8]Mark N. Ellingham, Derek A. Holton, Charles H. C. Little:
Cycles through ten vertices in 3-connected cubic graphs. Comb. 4(4): 265-273 (1984) - 1982
- [j7]Derek A. Holton, Brendan D. McKay, Michael D. Plummer, Carsten Thomassen:
A nine point theorem for 3-connected graphs. Comb. 2(1): 53-62 (1982) - [j6]Derek A. Holton, Charles H. C. Little:
Regular odd rings and non-planar graphs. Comb. 2(2): 149-152 (1982)
1970 – 1979
- 1978
- [j5]Julie Sims, Derek A. Holton:
Stability of cartesian products. J. Comb. Theory B 25(3): 258-282 (1978) - 1977
- [j4]K. C. Stacey, Derek A. Holton:
On the automorphism group of a tree. J. Comb. Theory B 22(1): 10-25 (1977) - 1975
- [j3]Charles H. C. Little, Douglas D. Grant, Derek A. Holton:
On defect-d matchings in graphs. Discret. Math. 13(1): 41-54 (1975) - 1974
- [j2]K. L. McAvaney, Douglas D. Grant, Derek A. Holton:
Stable and semi-stable unicyclic graphs. Discret. Math. 9(3): 277-288 (1974) - 1973
- [j1]Derek A. Holton:
Two applications of semi-stable graphs. Discret. Math. 4(2): 151-158 (1973)
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 20:22 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:
