Jerrold W. Grossman

According to our database1, Jerrold W. Grossman authored at least 17 papers between 1979 and 2013.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2013
The number of shortest paths in the arrangement graph.
Inf. Sci., 2013

Paul Erdős: The Master of Collaboration.
Proceedings of the Mathematics of Paul Erdős II, 2013

2010
Distance formula and shortest paths for the (n, k)-star graphs.
Inf. Sci., 2010

2003
Time-stamped Graphs and Their Associated Influence Digraphs.
Discret. Appl. Math., 2003

2002
Influence Digraphs Induced by Time-Stamped Graphs (Extended Abstract).
Electron. Notes Discret. Math., 2002

2001
Distinguishing between the Partite Sets of a Bipartite Graph: 10740.
Am. Math. Mon., 2001

2000
Avoiding Uncountably Many Subsets: 10667.
Am. Math. Mon., 2000

[untitled].
Am. Math. Mon., 2000

1997
Spanning Star Trees in Regular Graphs.
Graphs Comb., 1997

Dominating sets whose closed stars form spanning trees.
Discret. Math., 1997

On weakly connected domination in graphs.
Discret. Math., 1997

1992
Fractional Arboricity, Strength, and Principal Partitions in Graphs and Matroids.
Discret. Appl. Math., 1992

1988
An Inherently Iterative Computation of Ackermanns's Function.
Theor. Comput. Sci., 1988

1983
Graphs with unique Ramsey colorings.
J. Graph Theory, 1983

Alternating cycles in edge-partitioned graphs.
J. Comb. Theory, Ser. B, 1983

1982
Ramsey numbers of graphs with long tails.
Discret. Math., 1982

1979
Generalized ramsey theory for graphs, x: double stars.
Discret. Math., 1979


  Loading...