#### Filter Results:

- Full text PDF available (7)

#### Publication Year

1976

2017

- This year (1)
- Last 5 years (4)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Heather Jordon, Joy Morris
- Discrete Mathematics
- 2008

In this paper, we prove that cyclic hamiltonian cycle systems of the complete graph minus a 1-factor, Kn − I, exist if and only if n ≡ 2, 4( mod 8) and n 6= 2p with p prime and α ≥ 1.

- Saad El-Zanati, Heather Jordon, G. F. Seelinger, Papa Sissokho, L. E. Spence
- Des. Codes Cryptography
- 2010

- Heather Jordon
- Electr. J. Comb.
- 2011

In this paper, we settle Alspach’s problem in the case of Hamilton cycles and 5cycles; that is, we show that for all odd integers n ≥ 5 and all nonnegative integers h and t with hn + 5t = n(n − 1)/2, the complete graph Kn decomposes into h Hamilton cycles and t 5-cycles and for all even integers n ≥ 6 and all nonnegative integers h and t with hn+5t =… (More)

- Heather Jordon, Richard McBride, Shailesh K. Tipnis
- Discrete Mathematics
- 2009

- Dean Hoffman, Heather Jordon
- Journal of Graph Theory
- 2006

For a signed graph G and function f : V ðGÞ ! Z , a signed f -factor of G is a spanning subgraph F such that sdegF ðvÞ 1⁄4 f ðvÞ for every vertex v of G, where sdegðvÞ is the number of positive edges incident with v less the number of negative edges incident with v, with loops counting twice in either case. For a given vertex-function f , we provide… (More)

- Fong Chung, Olivia Simpson, +101 authors Nick Phillips
- 2014

Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory There are no uniquely Bipancyclic Graphs on Thirty-two Vertices.

- Heather Jordon, Joy Morris
- Discrete Mathematics
- 2009

In this paper, we prove that directed cyclic hamiltonian cycle systems of the complete symmetric digraph, K∗ n, exist if and only if n ≡ 2 (mod 4) and n 6= 2p with p prime and α ≥ 1. We also show that directed cyclic hamiltonian cycle systems of the complete symmetric digraph minus a set of n/2 vertex-independent digons, (Kn− I)∗, exist if and only if n ≡ 0… (More)

- Heather Jordon, Joy Morris
- Australasian J. Combinatorics
- 2017

In this paper, we provide necessary and sufficient conditions for the existence of a cyclic m-cycle system of Kn − I when m and n are even and m | n.

- Tina Helms, Heather Jordon, Maggie Murray, Stephanie Zeppetello
- Australasian J. Combinatorics
- 2012

A k-extended Skolem-type 5-tuple difference set of order t is a set of t 5-tuples {(di,1, di,2, di,3, di,4, di,5) | i = 1, 2, . . . , t} such that di,1+di,2+di,3+di,4+di,5 = 0 for 1 ≤ i ≤ t and {|di,j| | 1 ≤ i ≤ t, 1 ≤ j ≤ 5} = {1, 2, . . . , 5t+1}\{k}. In this talk, we will give necessary and sufficient conditions on t and k for the existence of a… (More)

Let G of order n be the vertex-disjoint union of an even and an odd cycle. It is known that there exists a G-decomposition of K v for all v ≡ 1 (mod 2n). We use an extension of the Bose construction for Steiner triple systems and a recent result on the Oberwolfach Problem for 2-regular graphs with two components to show that there exists a G-decomposition… (More)