Derek A. Holton - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 46 from 46

2007

2005

2004

Restricted permutations and queue jumpingMichael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley, Derek A. Holton. DM, 287(1-3):129-133, 2004. [doi]

Characterizing 2::::k::::-critical graphs and ::::n::::-extendable graphsRobert E. L. Aldred, Derek A. Holton, Dingjun Lou, Ning Zhong. DM, 287(1-3):135-139, 2004. [doi]

2003

::::M::::-alternating paths in ::::n::::-extendable bipartite graphsRobert E. L. Aldred, Derek A. Holton, Dingjun Lou, Akira Saito. DM, 269(1-3):1-11, 2003. [doi]

Students Satisfaction and Perceived Learning with a Web-based CourseKian-Sam Hong, Kwok-Wing Lai, Derek A. Holton. ETS, 6(1), 2003. [doi]

2002

On Packing Densities of PermutationsMichael H. Albert, Mike D. Atkinson, Chris C. Handley, Derek A. Holton, Walter Stromquist. combinatorics, 9(1), 2002. [doi]

2001

The ultimate categorical matching in a graphMichael H. Albert, Derek A. Holton, Richard J. Nowakowski. DM, 232(1-3):1-9, 2001. [doi]

Algorithms for Pattern Involvement in PermutationsMichael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Derek A. Holton. isaac 2001: 355-366 [doi]

Permutations of a Multiset Avoiding Permutations of Length 3Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Chris C. Handley, Derek A. Holton. ejc, 22(8):1021-1031, 2001. [doi]

*-connected graphsMichael H. Albert, Robert E. L. Aldred, Derek A. Holton. ajc, 24:193-208, 2001. [doi]

Covering hypercubes by isometric pathsShannon L. Fitzpatrick, Richard J. Nowakowski, Derek A. Holton, Ian Caines. DM, 240(1-3):253-260, 2001. [doi]

2000

Nonhamiltonian 3-Connected Cubic Planar GraphsRobert E. L. Aldred, S. Bau, Derek A. Holton, Brendan D. McKay. siamdm, 13(1):25-32, 2000. [doi]

Planar graphs, regular graphs, bipartite graphs and Hamiltonicity: CorrigendumDerek A. Holton, Robert E. L. Aldred. ajc, 21:311, 2000. [doi]

1999

Two results on matching extensions with prescribed and proscribed edge setsRobert E. L. Aldred, Derek A. Holton, M. I. Porteous, Michael D. Plummer. DM, 206(1-3):35-43, 1999. [doi]

Cycles Through 23 Vertices in 3-Connected Cubic Planar GraphsRobert E. L. Aldred, Sheng Bau, Derek A. Holton, Brendan D. McKay. gc, 15(4):373-376, 1999. [doi]

Planar graphs, regular graphs, bipartite graphs and HamiltonicityDerek A. Holton, Robert E. L. Aldred. ajc, 20:111-132, 1999. [doi]

1997

Cycles in quasi 4-connected graphsRobert E. L. Aldred, Mark N. Ellingham, Robert L. Hemminger, Derek A. Holton. ajc, 15:37-46, 1997. [doi]

1995

n-extendability of line graphs, power graphs, and total graphsDerek A. Holton, Dinjun Lou, K. L. McAvaney. ajc, 11:215-222, 1995. [doi]

1994

A degree characterisation of pancyclicityRobert E. L. Aldred, Derek A. Holton, Zang Ke Min. DM, 127(1-3):23-29, 1994. [doi]

1993

N-extendability of symmetric graphsRobert E. L. Aldred, Derek A. Holton, Dingjun Lou. jgt, 17(2):253-261, 1993. [doi]

The Petersen graphDerek A. Holton, John Sheehan. Volume 7 of Australian mathematical society lecture series, Cambridge University Press, 1993.

Lower bound of cyclic edge connectivity for n-extendability of regular graphsDingjun Lou, Derek A. Holton. DM, 112(1-3):139-150, 1993. [doi]

1992

Cycles and paths in multigraphsRoger B. Eggleton, Derek A. Holton, Charles H. C. Little. ajc, 5:3-12, 1992. [doi]

Matching extensions of strongly regular graphsDerek A. Holton, Dingjun Lou. ajc, 6:187-208, 1992. [doi]

1991

Uniform cyclic edge connectivity in cubic graphsRobert E. L. Aldred, Derek A. Holton, Bill Jackson. combinatorica, 11(2):81-96, 1991.

Cycles containing 12 vertices in 3-connected cubic graphsSheng Bau, Derek A. Holton. jgt, 15(4):421-429, 1991. [doi]

On the 2-extendability of planar graphsDerek A. Holton, Dingjun Lou, Michael D. Plummer. DM, 96(2):81-99, 1991. [doi]

1990

Removable edges in 3-connected graphsDerek A. Holton, Bill Jackson, Akira Saito, Nicholas C. Wormald. jgt, 14(4):465-473, 1990. [doi]

1988

An 11-vertex theorem for 3-connected cubic graphsRobert E. L. Aldred, Sheng Bau, Derek A. Holton, Gordon F. Royle. jgt, 12(4):561-570, 1988. [doi]

The smallest non-hamiltonian 3-connected cubic planar graphs have 38 verticesDerek A. Holton, Brendan D. McKay. JCT, 45(3):305-319, 1988. [doi]

1987

Cycles through five edges in 3-connected cubic graphsRobert E. L. Aldred, Derek A. Holton. gc, 3(1):299-311, 1987. [doi]

1985

Cycles through four edges in 3-connected cubic graphsRobert E. L. Aldred, Derek A. Holton, Carsten Thomassen. gc, 1(1):7-11, 1985. [doi]

Hamiltonian cycles in cubic 3-connected bipartite planar graphsDerek A. Holton, Bennet Manvel, Brendan D. McKay. JCT, 38(3):279-297, 1985. [doi]

No graph has a maximal 3-ring of bondsCharles H. C. Little, Derek A. Holton. JCT, 38(2):139-142, 1985. [doi]

1984

Cycles through ten vertices in 3-connected cubic graphsMark N. Ellingham, Derek A. Holton, Charles H. C. Little. combinatorica, 4(4):265-273, 1984.

1982

Regular odd rings and non-planar graphsDerek A. Holton, Charles H. C. Little. combinatorica, 2(2):149-152, 1982.

A nine point theorem for 3-connected graphsDerek A. Holton, Brendan D. McKay, Michael D. Plummer, Carsten Thomassen. combinatorica, 2(1):53-62, 1982.

1978

Stability of cartesian productsJulie Sims, Derek A. Holton. JCT, 25(3):258-282, 1978. [doi]

1977

On the automorphism group of a treeK. C. Stacey, Derek A. Holton. JCT, 22(1):10-25, 1977. [doi]

1975

On defect-d matchings in graphsCharles H. C. Little, Douglas D. Grant, Derek A. Holton. DM, 13(1):41-54, 1975. [doi]

1974

Stable and semi-stable unicyclic graphsK. L. McAvaney, Douglas D. Grant, Derek A. Holton. DM, 9(3):277-288, 1974. [doi]

1973

Two applications of semi-stable graphsDerek A. Holton. DM, 4(2):151-158, 1973. [doi]

Sign in or sign up to see more results.

runs on WebDSL