 | 2007 |
|---|
| 6 |       | L. William Kazmierczak,
F. Boesch,
D. Gross,
Charles L. Suffel:
Realizability Results Involving Two Connectivity Parameters.
Ars Comb. 82: (2007) |
| 1998 |
|---|
| 5 |  | L. Petingi,
F. Boesch,
Charles L. Suffel:
On the characterization of graphs with maximum number of spanning trees.
Discrete Mathematics 179(1-3): 155-166 (1998) |
| 1996 |
|---|
| 4 | | Lynne L. Doty,
R. J. Goldstone,
Charles L. Suffel:
Cayley Graphs with Neighbor Connectivity One.
SIAM J. Discrete Math. 9(4): 625-642 (1996) |
| 1993 |
|---|
| 3 | | Charles J. Colbourn,
Appajosyula Satyanarayana,
Charles L. Suffel,
Klaus Sutner:
Computing Residual Connectedness Reliability for Restricted Networks.
Discrete Applied Mathematics 44(1-3): 221-232 (1993) |
| 1991 |
|---|
| 2 | | Klaus Sutner,
Appajosyula Satyanarayana,
Charles L. Suffel:
The Complexity of the Residual Node Connectedness Reliability Problem.
SIAM J. Comput. 20(1): 149-155 (1991) |
| 1983 |
|---|
| 1 | | Douglas Bauer,
Frank Harary,
Juhani Nieminen,
Charles L. Suffel:
Domination alteration sets in graphs.
Discrete Mathematics 47: 153-161 (1983) |
