Sarah K. Merz

According to our database, Sarah K. Merz authored at least 7 papers between 1995 and 2011.

Collaborative distances:

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

2011

The (1, 2)-step competition graph of a tournament.

Kim A. S. Factor, Sarah K. Merz

Discret. Appl. Math., 2011

2006

Domination Parameters and Gallai-type Theorems for Directed Trees.

Jason Albertson, Audene Harris, Larry J. Langley, Sarah K. Merz

Ars Comb., 2006

2003

Domination Graphs of Tournaments with Isolated Vertices.

David C. Fisher, J. Richard Lundgren, David R. Guichard, Sarah K. Merz, K. Brooks Reid

Ars Comb., 2003

2001

Domination Graphs with Nontrivial Components.

David C. Fisher, David R. Guichard, J. Richard Lundgren, Sarah K. Merz, K. Brooks Reid

Graphs Comb., 2001

1998

The domination and competition graphs of a tournament.

David C. Fisher, J. Richard Lundgren, Sarah K. Merz, K. Brooks Reid

J. Graph Theory, 1998

1997

The p-Competition Graphs of Strongly Connected and Hamiltonian Digraphs.

J. Richard Lundgren, Patricia A. McKenna, Larry J. Langley, Sarah K. Merz, Craig W. Rasmussen

Ars Comb., 1997

1995

Competition Graphs of Strongly Connected and Hamiltonian Digraphs.

Kathryn Fraughnaugh, J. Richard Lundgren, Sarah K. Merz, John S. Maybee, Norman J. Pullman

SIAM J. Discret. Math., 1995