Heather Gavlas

According to our database, Heather Gavlas authored at least 11 papers between 1995 and 2004.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2004

Cycle systems in the complete bipartite graph minus a one-factor.

Dan Archdeacon, Marisa Debowsky, Jeffrey H. Dinitz, Heather Gavlas

Discret. Math., 2004

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

Hamiltonian Paths in Cartesian Powers of Directed Cycles.

David Austin, Heather Gavlas, Dave Witte

Graphs Comb., 2003

Factorizations of the Complete Graph into <i>C</i> ₅-Factors and 1-Factors.

Peter Adams, Darryn E. Bryant, Saad I. El-Zanati, Heather Gavlas

Graphs Comb., 2003

Skolem-type Difference Sets for Cycle Systems.

Darryn E. Bryant, Heather Gavlas, Alan C. H. Ling

Electron. J. Comb., 2003

2002

Efficient Open Domination.

Heather Gavlas, Kelly Schultz

Electron. Notes Discret. Math., 2002

2001

Cycle Decompositions of K_n and K_n-I.

Brian Alspach, Heather Gavlas

J. Comb. Theory B, 2001

A New Distance Measure between Graphs.

Heather Gavlas

Ars Comb., 2001

1998

Automorphism groups with cyclic commutator subgroup and Hamilton cycles.

Edward Dobson, Heather Gavlas, Joy Morris, Dave Witte

Discret. Math., 1998

1997

Rotation and jump distances between graphs.

Gary Chartrand, Heather Gavlas, Héctor Hevia, Mark A. Johnson

Discuss. Math. Graph Theory, 1997

1995

Convergent sequences of iterated H-line graphs.

Gary Chartrand, Heather Gavlas, Michelle Schultz

Discret. Math., 1995