 | 2009 |
|---|
| 3 |       | Frank Boesch,
Daniel Gross,
John T. Saccoman,
L. William Kazmierczak,
Charles L. Suffel,
Antonius Suhartomo:
A generalization of an edge-connectivity theorem of Chartrand.
Networks 54(2): 82-89 (2009) |
| 2007 |
|---|
| 2 |  | L. William Kazmierczak,
Frank Boesch,
Daniel Gross,
Charles L. Suffel:
Realizability Results Involving Two Connectivity Parameters.
Ars Comb. 82: (2007) |
| 1998 |
|---|
| 1 | | Louis Petingi,
Frank Boesch,
Charles L. Suffel:
On the characterization of graphs with maximum number of spanning trees.
Discrete Mathematics 179(1-3): 155-166 (1998) |
Data released under the ODC-BY 1.0 license — See also our legal information page