 | 2010 |
|---|
| 9 |       | Eddie Cheng,
Jerrold W. Grossman,
László Lipták,
Ke Qiu,
Zhizhang Shen:
Distance formula and shortest paths for the (n, k)-star graphs.
Inf. Sci. 180(9): 1671-1680 (2010) |
| 2003 |
|---|
| 8 | | Eddie Cheng,
Jerrold W. Grossman,
Marc J. Lipman:
Time-stamped Graphs and Their Associated Influence Digraphs.
Discrete Applied Mathematics 128(2-3): 317-335 (2003) |
| 2002 |
|---|
| 7 | | Eddie Cheng,
Jerrold W. Grossman,
Marc J. Lipman:
Influence Digraphs Induced by Time-Stamped Graphs (Extended Abstract).
Electronic Notes in Discrete Mathematics 11: 128-139 (2002) |
| 1997 |
|---|
| 6 | | Jean E. Dunbar,
Jerrold W. Grossman,
Johannes H. Hattingh,
Stephen T. Hedetniemi,
Alice A. McRae:
On weakly connected domination in graphs.
Discrete Mathematics 167-168: 261-269 (1997) |
| 5 | | Jerrold W. Grossman:
Dominating sets whose closed stars form spanning trees.
Discrete Mathematics 169(1-3): 83-94 (1997) |
| 1992 |
|---|
| 4 |  | Paul A. Catlin,
Jerrold W. Grossman,
Arthur M. Hobbs,
Hong-Jian Lai:
Fractional Arboricity, Strength, and Principal Partitions in Graphs and Matroids.
Discrete Applied Mathematics 40(3): 285-302 (1992) |
| 1988 |
|---|
| 3 | | Jerrold W. Grossman,
R. Suzanne Zeitman:
An Inherently Iterative Computation of Ackermanns's Function.
Theor. Comput. Sci. 57: 327-330 (1988) |
| 1983 |
|---|
| 2 | | Jerrold W. Grossman,
Roland Häggkvist:
Alternating cycles in edge-partitioned graphs.
J. Comb. Theory, Ser. B 34(1): 77-81 (1983) |
| 1982 |
|---|
| 1 | | S. A. Burr,
Jerrold W. Grossman:
Ramsey numbers of graphs with long tails.
Discrete Mathematics 41(3): 223-227 (1982) |
Data released under the ODC-BY 1.0 license — See also our legal information page