default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJerrold W. Grossman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2013
[j16]Eddie Cheng
, Jerrold W. Grossman, Ke Qiu, Zhizhang Shen:
The number of shortest paths in the arrangement graph. Inf. Sci. 240: 191-204 (2013)- 2010
- [j15]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
- [j14]Eddie Cheng, Jerrold W. Grossman, Marc J. Lipman:
Time-stamped Graphs and Their Associated Influence Digraphs. Discret. Appl. Math. 128(2-3): 317-335 (2003) - 2002
- [j13]Eddie Cheng, Jerrold W. Grossman, Marc J. Lipman:
Influence Digraphs Induced by Time-Stamped Graphs (Extended Abstract). Electron. Notes Discret. Math. 11: 128-139 (2002) - 2001
- [j12]Charles Vanden Eynden, Jerrold W. Grossman:
Distinguishing between the Partite Sets of a Bipartite Graph: 10740. Am. Math. Mon. 108(4): 375 (2001) - 2000
- [j11]Zoltán Sasvári, Jerrold W. Grossman, Sung Soo Kim:
Avoiding Uncountably Many Subsets: 10667. Am. Math. Mon. 107(4): 371-372 (2000) - [j10]Jerrold W. Grossman:
[untitled]. Am. Math. Mon. 107(7): 664-668 (2000) - 1997
- [j9]Jean E. Dunbar, Jerrold W. Grossman, Johannes H. Hattingh, Stephen T. Hedetniemi, Alice A. McRae:
On weakly connected domination in graphs. Discret. Math. 167-168: 261-269 (1997) - [j8]Jerrold W. Grossman:
Dominating sets whose closed stars form spanning trees. Discret. Math. 169(1-3): 83-94 (1997) - [j7]Jerrold W. Grossman:
Spanning Star Trees in Regular Graphs. Graphs Comb. 13(4): 353-358 (1997) - 1992
- [j6]Paul A. Catlin, Jerrold W. Grossman, Arthur M. Hobbs, Hong-Jian Lai:
Fractional Arboricity, Strength, and Principal Partitions in Graphs and Matroids. Discret. Appl. Math. 40(3): 285-302 (1992) - 1988
- [j5]Jerrold W. Grossman, R. Suzanne Zeitman:
An Inherently Iterative Computation of Ackermanns's Function. Theor. Comput. Sci. 57: 327-330 (1988) - 1983
- [j4]Jerrold W. Grossman, Roland Häggkvist:
Alternating cycles in edge-partitioned graphs. J. Comb. Theory B 34(1): 77-81 (1983) - [j3]Jerrold W. Grossman:
Graphs with unique Ramsey colorings. J. Graph Theory 7(1): 85-90 (1983) - 1982
- [j2]S. A. Burr, Jerrold W. Grossman:
Ramsey numbers of graphs with long tails. Discret. Math. 41(3): 223-227 (1982) - 1979
- [j1]Jerrold W. Grossman, Frank Harary, Maria M. Klawe:
Generalized ramsey theory for graphs, x: double stars. Discret. Math. 28(3): 247-254 (1979)
Parts in Books or Collections
- 2013
- [p1]Jerrold W. Grossman:
Paul Erdős: The Master of Collaboration. The Mathematics of Paul Erdős II 2013: 489-496
Editorship
- 1999
- [e1]Kenneth H. Rosen, John G. Michaels, Jonathan L. Gross, Jerrold W. Grossman, Douglas R. Shier:
Handbook of Discrete and Combinatorial Mathematics. CRC Press 1999, ISBN 978-0-8493-0149-0 [contents]
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
