Derek A. Holton

Australas. J Comb., 2007

Compositions of pattern restricted sets of permutations.

[BibT_eX]

[DOI]

Chris C. Handley

D. J. McCaughan

Australas. J Comb., 2007

2005

Permuting machines and priority queues.

[BibT_eX]

[DOI]

Chris C. Handley

D. J. McCaughan

Theor. Comput. Sci., 2005

2-factors with prescribed and proscribed edges.

[BibT_eX]

[DOI]

John Sheehan

J. Graph Theory, 2005

Sorting Classes.

[BibT_eX]

[DOI]

Electron. J. Comb., 2005

2004

Characterizing 2k-critical graphs and n-extendable graphs.

[BibT_eX]

[DOI]

Discret. Math., 2004

Restricted permutations and queue jumping.

[BibT_eX]

[DOI]

Chris C. Handley

Discret. Math., 2004

2003

Students' Satisfaction and Perceived Learning with a Web-based Course.

[BibT_eX]

[DOI]

Kian-Sam Hong

Kwok-Wing Lai

J. Educ. Technol. Soc., 2003

M-alternating paths in n-extendable bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 2003

2002

On Packing Densities of Permutations.

[BibT_eX]

[DOI]

Electron. J. Comb., 2002

2001

Permutations of a Multiset Avoiding Permutations of Length 3.

[BibT_eX]

[DOI]

Eur. J. Comb., 2001

Covering hypercubes by isometric paths.

[BibT_eX]

[DOI]

Shannon L. Fitzpatrick

Richard J. Nowakowski

Ian Caines

Discret. Math., 2001

The ultimate categorical matching in a graph.

[BibT_eX]

[DOI]

Richard J. Nowakowski

Discret. Math., 2001

On 3*-connected graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2001

Algorithms for Pattern Involvement in Permutations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000

Nonhamiltonian 3-Connected Cubic Planar Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2000

Planar graphs, regular graphs, bipartite graphs and Hamiltonicity: Corrigendum.

[BibT_eX]

[DOI]

Australas. J Comb., 2000

1999

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

[BibT_eX]

[DOI]

Graphs Comb., 1999

Two results on matching extensions with prescribed and proscribed edge sets.

[BibT_eX]

[DOI]

Discret. Math., 1999

Planar graphs, regular graphs, bipartite graphs and Hamiltonicity.

[BibT_eX]

[DOI]

Australas. J Comb., 1999

1997

Cycles in quasi 4-connected graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 1997

1995

n-extendability of line graphs, power graphs, and total graphs.

[BibT_eX]

[DOI]

K. L. McAvaney

Australas. J Comb., 1995

1994

A degree characterisation of pancyclicity.

[BibT_eX]

[DOI]

Zang Ke Min

Discret. Math., 1994

1993

N-extendability of symmetric graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1993

Lower bound of cyclic edge connectivity for n-extendability of regular graphs.

[BibT_eX]

[DOI]

Discret. Math., 1993

The Petersen graph.

[BibT_eX]

John Sheehan

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

1992

Matching extensions of strongly regular graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 1992

Cycles and paths in multigraphs.

[BibT_eX]

[DOI]

Roger B. Eggleton

Australas. J Comb., 1992

1991

Cycles containing 12 vertices in 3-connected cubic graphs.

[BibT_eX]

[DOI]

Sheng Bau

J. Graph Theory, 1991

On the 2-extendability of planar graphs.

[BibT_eX]

[DOI]

Michael D. Plummer

Discret. Math., 1991

Uniform cyclic edge connectivity in cubic graphs.

[BibT_eX]

[DOI]

Bill Jackson

Comb., 1991

1990

Removable edges in 3-connected graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1990

1988

An 11-vertex theorem for 3-connected cubic graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1988

The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices.

[BibT_eX]

[DOI]

Brendan D. McKay

J. Comb. Theory B, 1988

1987

Cycles through five edges in 3-connected cubic graphs.

[BibT_eX]

[DOI]

Graphs Comb., 1987

1985

No graph has a maximal 3-ring of bonds.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1985

Hamiltonian cycles in cubic 3-connected bipartite planar graphs.

[BibT_eX]

[DOI]

Bennet Manvel

Brendan D. McKay

J. Comb. Theory B, 1985

Cycles through four edges in 3-connected cubic graphs.

[BibT_eX]

[DOI]

Carsten Thomassen

Graphs Comb., 1985

1984

Cycles through ten vertices in 3-connected cubic graphs.

[BibT_eX]

[DOI]

Mark N. Ellingham

Comb., 1984

1982

A nine point theorem for 3-connected graphs.

[BibT_eX]

[DOI]

Comb., 1982

Regular odd rings and non-planar graphs.

[BibT_eX]

[DOI]

Comb., 1982

1978

Stability of cartesian products.

[BibT_eX]

[DOI]

Julie Sims

J. Comb. Theory B, 1978

1977

On the automorphism group of a tree.

[BibT_eX]

[DOI]

K. C. Stacey

J. Comb. Theory B, 1977

1975

On defect-d matchings in graphs.

[BibT_eX]

[DOI]

Douglas D. Grant

Discret. Math., 1975

1974

Stable and semi-stable unicyclic graphs.

[BibT_eX]

[DOI]

K. L. McAvaney

Douglas D. Grant

Discret. Math., 1974

1973

Two applications of semi-stable graphs.

[BibT_eX]

[DOI]