Evan B. Wantland

According to our database, Evan B. Wantland authored at least 4 papers between 1995 and 2003.

Collaborative distances:

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

2003

Amalgamations of connected k-factorizations.

Anthony J. W. Hilton, Matthew Johnson, Christopher A. Rodger, Evan B. Wantland

J. Comb. Theory, Ser. B, 2003

2002

Which Graphs Have Hall Number Two?

Peter D. Johnson Jr., Evan B. Wantland

Ars Comb., 2002

1996

Thwart numbers of some bipartite graphs.

Dean G. Hoffman, Peter D. Johnson Jr., Evan B. Wantland

Australas. J Comb., 1996

1995

Embedding edge-colorings into 2-edge-connected <i>k</i>-factorizations of <i>k_kn+1</i>.

C. A. Rodger, Evan B. Wantland

J. Graph Theory, 1995