Robert E. L. Aldred

,

Bill Jackson

,

J. Graph Theory, October, 2023

Removal of subgraphs and perfect matchings in graphs on surfaces.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2023

Distance Matching Extension in Cubic Bipartite Graphs.

[BibT_eX]

[DOI]

,

,

Graphs Comb., 2021

Asymmetric distance matching extension.

[BibT_eX]

[DOI]

,

Watcharintorn Ruksasakchai

,

Australas. J Comb., 2021

Distance restricted matching extension missing vertices and edges in 5-connected triangulations of the plane.

[BibT_eX]

[DOI]

,

Watcharintorn Ruksasakchai

,

J. Graph Theory, 2020

Distance matching extension and local structure of graphs.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 2020

Cycles in 5-connected triangulations.

[BibT_eX]

[DOI]

Adel Alahmadi

,

,

J. Comb. Theory, Ser. B, 2020

Extendability and Criticality in Matching Theory.

[BibT_eX]

[DOI]

,

Graphs Comb., 2020

Restricted matching in plane triangulations and near triangulations.

[BibT_eX]

[DOI]

,

Watcharintorn Ruksasakchai

,

Discret. Appl. Math., 2020

Pairs and triples of forbidden subgraphs and the existence of a 2-factor.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 2019

Edge proximity and matching extension in punctured planar triangulations.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2017

Matching extension in prism graphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2017

Edge-disjoint node-independent spanning trees in dense Gaussian networks.

[BibT_eX]

[DOI]

,

,

,

J. Supercomput., 2016

Extending a perfect matching to a Hamiltonian cycle.

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Math. Theor. Comput. Sci., 2015

The minimum number of minimal codewords in an [n, k]-code and in graphic codes.

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Appl. Math., 2015

Matching extension in toroidal quadrangulations II: the 3-extendable case.

[BibT_eX]

[DOI]

,

,

,

,

Australas. J Comb., 2015

Distance-Restricted Matching Extension in Triangulations of the Torus and the Klein Bottle.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2014

The maximum number of minimal codewords in an [n, k][n, k]-code.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2013

The maximum number of minimal codewords in long codes.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2013

Matching extension in quadrangulations of the torus.

[BibT_eX]

[DOI]

,

,

,

Australas. J Comb., 2013

Proximity thresholds for matching extension in the torus and Klein bottle.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2012

The maximum number of minimal codewords in an $[n,k]-$code

[BibT_eX]

[DOI]

,

,

,

,

CoRR, 2012

Graphs with the cycle extension property.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2012

Proximity thresholds for matching extension in planar and projective planar triangulations.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2011

The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity.

[BibT_eX]

[DOI]

,

,

,

,

J. Graph Theory, 2011

Forbidden subgraphs and the existence of a 2-factor.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 2010

The structure of 4-gamma-critical graphs with a cut vertex.

[BibT_eX]

[DOI]

Watcharaphong Ananchuen

,

Nawarat Ananchuen

,

Discret. Math., 2010

Distance-restricted matching extension in planar triangulations.

[BibT_eX]

[DOI]

,

Discret. Math., 2010

Avoiding consecutive patterns in permutations.

[BibT_eX]

[DOI]

,

,

D. J. McCaughan

Adv. Appl. Math., 2010

Corrigendum to "Graphs and digraphs with all 2-factors isomorphic" [J. Combin. Theory Ser. B 92 (2) (2004) 395-404].

[BibT_eX]

[DOI]

,

,

,

,

,

J. Comb. Theory B, 2009

Graph structural properties of non-Yutsis graphs allowing fast recognition.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2009

Two forbidden subgraphs and the existence of a 2-factor in graphs.

[BibT_eX]

[DOI]

,

,

Australas. J Comb., 2009

On the maximum number of cycles in a planar graph.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2008

On the matching extendability of graphs in surfaces.

[BibT_eX]

[DOI]

,

Ken-ichi Kawarabayashi

,

J. Comb. Theory B, 2008

Restricted matching in graphs of small genus.

[BibT_eX]

[DOI]

,

Discret. Math., 2008

Edge proximity conditions for extendability in cubic bipartite graphs.

[BibT_eX]

[DOI]

,

Bill Jackson

J. Graph Theory, 2007

Perfect matchings after vertex deletions.

[BibT_eX]

[DOI]

,

Richard P. Anstee

,

Stephen C. Locke

Discret. Math., 2007

Cyclically closed pattern classes of permutations.

[BibT_eX]

[DOI]

,

,

,

,

,

,

,

Australas. J Comb., 2007

Compositions of pattern restricted sets of permutations.

[BibT_eX]

[DOI]

,

,

,

,

,

,

D. J. McCaughan

Australas. J Comb., 2007

Permuting machines and priority queues.

[BibT_eX]

[DOI]

,

,

,

,

,

D. J. McCaughan

Theor. Comput. Sci., 2005

2-factors with prescribed and proscribed edges.

[BibT_eX]

[DOI]

,

,

John Sheehan

J. Graph Theory, 2005

Vertex colouring edge partitions.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory B, 2005

Sorting Classes.

[BibT_eX]

[DOI]

,

,

,

,

,

,

Electron. J. Comb., 2005

Safe communication for card players by combinatorial designs for two-step protocols.

[BibT_eX]

[DOI]

,

,

,

,

Australas. J Comb., 2005

Regular bipartite graphs with all 2-factors isomorphic.

[BibT_eX]

[DOI]

,

,

,

,

J. Comb. Theory B, 2004

Graphs and digraphs with all 2-factors isomorphic.

[BibT_eX]

[DOI]

,

,

,

,

,

J. Comb. Theory B, 2004

Graphs with not all possible path-kernels.

[BibT_eX]

[DOI]

,

Discret. Math., 2004

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

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2004

Restricted permutations and queue jumping.

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Math., 2004

Edge proximity and matching extension in planar triangulations.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2004

A note on the number of graceful labellings of paths.

[BibT_eX]

[DOI]

,

Jozef Sirán

,

Martin Sirán

Discret. Math., 2003

M-alternating paths in n-extendable bipartite graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2003

Longest subsequences in permutations.

[BibT_eX]

[DOI]

,

,

Michael D. Atkinson

,

,

B. D. Handley

,

,

Jaroslav Opatrny

Australas. J Comb., 2003

Permutations of a Multiset Avoiding Permutations of Length 3.

[BibT_eX]

[DOI]

,

,

,

,

Eur. J. Comb., 2001

On restricted matching extension in planar graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2001

On 3*-connected graphs.

[BibT_eX]

[DOI]

,

,

Australas. J Comb., 2001

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

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

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 1999

On matching extensions with prescribed and proscribed edge sets II.

[BibT_eX]

[DOI]

,

Discret. Math., 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

More on the linear k-arboricity of regular graphs.

[BibT_eX]

[DOI]

,

Nicholas C. Wormald

Australas. J Comb., 1998

P3-isomorphisms for graphs.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 1997

On the Number of Cycles in 3-Connected Cubic Graphs.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 1997

Cycles in quasi 4-connected graphs.

[BibT_eX]

[DOI]

,

,

,

Australas. J Comb., 1997

Matching extensions with prescribed and forbidden edges.

[BibT_eX]

[DOI]

M. I. Porteous

,

Australas. J Comb., 1996

The 3-connected graphs with a longest path containing precisely two contractible edges.

[BibT_eX]

[DOI]

,

Chen Jian

,

Australas. J Comb., 1996

On the density of sets of divisors.

[BibT_eX]

[DOI]

,

Richard P. Anstee

Discret. Math., 1995

On Hamilton cycles and contractible edges in 3-connected graphs.

[BibT_eX]

[DOI]

,

Australas. J Comb., 1995

A degree characterisation of pancyclicity.

[BibT_eX]

[DOI]

,

,

Zang Ke Min

Discret. Math., 1994

The 3-connected graphs having a longest cycle containing only three contractible edges.

[BibT_eX]

[DOI]

,

,

Katsuhiro Ota

J. Graph Theory, 1993

N-extendability of symmetric graphs.

[BibT_eX]

[DOI]

,

,

Dingjun Lou

J. Graph Theory, 1993

Maximum matchings in 3-connected graphs contain contractible edges.

[BibT_eX]

[DOI]

,

,

Xingxing Yu

Australas. J Comb., 1992

Note on distance-regular graphs with a pair of equal subdegrees.

[BibT_eX]

[DOI]

Australas. J Comb., 1992

Partitioning regular graphs into equicardinal linear forests.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 1991

Uniform cyclic edge connectivity in cubic graphs.

[BibT_eX]

[DOI]

,

,

Bill Jackson

Comb., 1991

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

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 1988

Distance-regular antipodai covering graphs.

[BibT_eX]

[DOI]

,

Chris D. Godsil

J. Comb. Theory B, 1988

Cycles through five edges in 3-connected cubic graphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 1987

Cycles through four edges in 3-connected cubic graphs.

[BibT_eX]

[DOI]

,

,