Derek A. Holton

According to our database1, Derek A. Holton authored at least 46 papers between 1973 and 2007.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2007
Cyclically closed pattern classes of permutations.
Australas. J Comb., 2007

Compositions of pattern restricted sets of permutations.
Australas. J Comb., 2007

2005
Permuting machines and priority queues.
Theor. Comput. Sci., 2005

2-factors with prescribed and proscribed edges.
J. Graph Theory, 2005

Sorting Classes.
Electron. J. Comb., 2005

2004
Characterizing 2<i>k</i>-critical graphs and <i>n</i>-extendable graphs.
Discret. Math., 2004

Restricted permutations and queue jumping.
Discret. Math., 2004

2003
Students' Satisfaction and Perceived Learning with a Web-based Course.
J. Educ. Technol. Soc., 2003

<i>M</i>-alternating paths in <i>n</i>-extendable bipartite graphs.
Discret. Math., 2003

2002
On Packing Densities of Permutations.
Electron. J. Comb., 2002

2001
Permutations of a Multiset Avoiding Permutations of Length 3.
Eur. J. Comb., 2001

Covering hypercubes by isometric paths.
Discret. Math., 2001

The ultimate categorical matching in a graph.
Discret. Math., 2001

On 3<sup>*</sup>-connected graphs.
Australas. J Comb., 2001

Algorithms for Pattern Involvement in Permutations.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000
Nonhamiltonian 3-Connected Cubic Planar Graphs.
SIAM J. Discret. Math., 2000

Planar graphs, regular graphs, bipartite graphs and Hamiltonicity: Corrigendum.
Australas. J Comb., 2000

1999
Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs.
Graphs Comb., 1999

Two results on matching extensions with prescribed and proscribed edge sets.
Discret. Math., 1999

Planar graphs, regular graphs, bipartite graphs and Hamiltonicity.
Australas. J Comb., 1999

1997
Cycles in quasi 4-connected graphs.
Australas. J Comb., 1997

1995
n-extendability of line graphs, power graphs, and total graphs.
Australas. J Comb., 1995

1994
A degree characterisation of pancyclicity.
Discret. Math., 1994

1993
N-extendability of symmetric graphs.
J. Graph Theory, 1993

Lower bound of cyclic edge connectivity for n-extendability of regular graphs.
Discret. Math., 1993

The Petersen graph.
Australian mathematical society lecture series 7, Cambridge University Press, ISBN: 978-0-521-43594-9, 1993

1992
Matching extensions of strongly regular graphs.
Australas. J Comb., 1992

Cycles and paths in multigraphs.
Australas. J Comb., 1992

1991
Cycles containing 12 vertices in 3-connected cubic graphs.
J. Graph Theory, 1991

On the 2-extendability of planar graphs.
Discret. Math., 1991

Uniform cyclic edge connectivity in cubic graphs.
Comb., 1991

1990
Removable edges in 3-connected graphs.
J. Graph Theory, 1990

1988
An 11-vertex theorem for 3-connected cubic graphs.
J. Graph Theory, 1988

The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices.
J. Comb. Theory B, 1988

1987
Cycles through five edges in 3-connected cubic graphs.
Graphs Comb., 1987

1985
No graph has a maximal 3-ring of bonds.
J. Comb. Theory B, 1985

Hamiltonian cycles in cubic 3-connected bipartite planar graphs.
J. Comb. Theory B, 1985

Cycles through four edges in 3-connected cubic graphs.
Graphs Comb., 1985

1984
Cycles through ten vertices in 3-connected cubic graphs.
Comb., 1984

1982
A nine point theorem for 3-connected graphs.
Comb., 1982

Regular odd rings and non-planar graphs.
Comb., 1982

1978
Stability of cartesian products.
J. Comb. Theory B, 1978

1977
On the automorphism group of a tree.
J. Comb. Theory B, 1977

1975
On defect-d matchings in graphs.
Discret. Math., 1975

1974
Stable and semi-stable unicyclic graphs.
Discret. Math., 1974

1973
Two applications of semi-stable graphs.
Discret. Math., 1973


  Loading...