default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLinda Eroh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j16]Nadia Benakli
, Novi H. Bong, Shonda Dueck, Linda Eroh, Beth Novick, Ortrud R. Oellermann:
The threshold strong dimension of a graph. Discret. Math. 344(7): 112402 (2021)- 2020
- [j15]Linda Eroh, Cong X. Kang, Eunjeong Yi:
The connected metric dimension at a vertex of a graph. Theor. Comput. Sci. 806: 53-69 (2020) - 2016
- [j14]Linda Eroh, Henry Escuadro, Ralucca Gera, Samuel Prahlow, Karl R. B. Schmitt:
A graph theoretical analysis of the number of edges in k-dense graphs. Electron. J. Graph Theory Appl. 4(1): 26-41 (2016) - 2015
- [j13]Linda Eroh, Cong X. Kang, Eunjeong Yi:
On zero forcing number of graphs and their complements. Discret. Math. Algorithms Appl. 7(1): 1550002:1-1550002:10 (2015) - 2014
- [j12]Grady Bullington, Linda Eroh, Steven J. Winters:
Prisoners and Guards on Rectangular Boards. J. Integer Seq. 17(8): 14.8.1 (2014) - 2013
- [j11]Linda Eroh, Cong X. Kang, Eunjeong Yi:
On Metric Dimension of functigraphs. Discret. Math. Algorithms Appl. 5(4) (2013) - 2012
- [j10]Linda Eroh, Ralucca Gera:
Alliance Partition Number in Graphs. Ars Comb. 103: 519-529 (2012) - [j9]Linda Eroh, Ralucca Gera, Cong X. Kang, Craig E. Larson, Eunjeong Yi:
Domination in functigraphs. Discuss. Math. Graph Theory 32(2): 299-319 (2012) - 2011
- [j8]Grady Bullington, Linda Eroh, Ralucca Gera, Steven J. Winters:
Closed k-stop distance in graphs. Discuss. Math. Graph Theory 31(3): 533-545 (2011) - 2010
- [j7]Grady Bullington, Linda Eroh, Steven J. Winters:
γ-labelings of complete bipartite graphs. Discuss. Math. Graph Theory 30(1): 45-54 (2010) - 2008
- [j6]Linda Eroh, Ortrud R. Oellermann:
Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs. Discret. Math. 308(18): 4212-4220 (2008) - 2007
- [j5]Grady Bullington, Linda Eroh, Kevin McDougal, Hosien Moghadam, Steven J. Winters:
Path and cycle decomposition numbers. Australas. J Comb. 39: 89-102 (2007) - 2004
- [j4]Linda Eroh, Ortrud Oellermann:
Bipartite rainbow Ramsey numbers. Discret. Math. 277(1-3): 57-72 (2004) - 2000
- [j3]Gary Chartrand, Linda Eroh, Frank Harary, Ping Zhang:
How large can the domination numbers of a graph be? Australas. J Comb. 21: 23-36 (2000) - [j2]Gary Chartrand, Linda Eroh, Mark A. Johnson, Ortrud Oellermann:
Resolvability in graphs and the metric dimension of a graph. Discret. Appl. Math. 105(1-3): 99-113 (2000) - 1998
- [j1]Linda Eroh, Michelle Schultz:
Matching graphs. J. Graph Theory 29(2): 73-86 (1998)
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 2024-04-24 23:20 CEST 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:
