Convergent sequences of iterated H-line graphs. - Gary Chartrand; Heather Gavlas; Michelle Schultz (Discret. Math., 1995)

Rotation and jump distances between graphs. - Gary Chartrand; Heather Gavlas; Héctor Hevia; Mark A. Johnson (Discuss. Math. Graph Theory, 1997)

Automorphism groups with cyclic commutator subgroup and Hamilton cycles. - Edward Dobson; Heather Gavlas; Joy Morris; Dave Witte (Discret. Math., 1998)

A New Distance Measure between Graphs. - Heather Gavlas (Ars Comb., 2001)

Cycle Decompositions of Kn and Kn-I. - Brian Alspach; Heather Gavlas (J. Comb. Theory B, 2001)

Efficient Open Domination. - Heather Gavlas; Kelly Schultz (Electron. Notes Discret. Math., 2002)

Skolem-type Difference Sets for Cycle Systems. - Darryn E. Bryant; Heather Gavlas; Alan C. H. Ling (Electron. J. Comb., 2003)

Factorizations of the Complete Graph into C 5-Factors and 1-Factors. - Peter Adams 001; Darryn E. Bryant; Saad I. El-Zanati; Heather Gavlas (Graphs Comb., 2003)

Hamiltonian Paths in Cartesian Powers of Directed Cycles. - David Austin; Heather Gavlas; Dave Witte (Graphs Comb., 2003)

Cycle decompositions IV: complete directed graphs and fixed length directed cycles. - Brian Alspach; Heather Gavlas; Mateja Sajna; Helen Verrall (J. Comb. Theory A, 2003)

Cycle systems in the complete bipartite graph minus a one-factor. - Dan Archdeacon; Marisa Debowsky; Jeffrey H. Dinitz; Heather Gavlas (Discret. Math., 2004)