default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoger C. Entringer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2000
[j23]Peter Dankelmann, Roger C. Entringer:
Average distance, minimum degree, and spanning trees. J. Graph Theory 33(1): 1-13 (2000)
1990 – 1999
- 1997
- [j22]Curtis A. Barefoot, Roger C. Entringer, László A. Székely:
Extremal Values for Ratios of Distances in Trees. Discret. Appl. Math. 80(1): 37-56 (1997) - [j21]Roger C. Entringer, Wayne Goddard, Michael A. Henning:
A note on cliques and independent sets. J. Graph Theory 24(1): 21-23 (1997) - 1996
- [j20]Curtis A. Barefoot, Lane H. Clark, Roger C. Entringer, T. D. Porter, László A. Székely, Zsolt Tuza:
Cycle-saturated graphs of minimum size. Discret. Math. 150(1-3): 31-48 (1996) - 1994
- [j19]Roger C. Entringer, Amram Meir, John W. Moon, László A. Székely:
On the Wiener index of trees from certain families. Australas. J Comb. 10: 211-224 (1994) - [j18]Curtis A. Barefoot, Lane H. Clark, A. J. Depew, Roger C. Entringer, László A. Székely:
Subdivision thresholds for two classes of graphs. Discret. Math. 125(1-3): 15-30 (1994) - 1992
- [j17]László A. Székely, Lane H. Clark, Roger C. Entringer:
An inequality for degree sequences. Discret. Math. 103(3): 293-300 (1992) - [j16]Lane H. Clark, Roger C. Entringer, Henry D. Shapiro:
Smallest maximally nonhamiltonian graphs II. Graphs Comb. 8(3): 225-231 (1992) - 1991
- [j15]Lane H. Clark, Roger C. Entringer, Joseph E. McCanna, László A. Székely:
Extremal problems for local properties of graphs. Australas. J Comb. 4: 25-32 (1991) - [j14]Lane H. Clark, Roger C. Entringer, László A. Székely:
Threshold functions for local properties of graphs: triangles. Discret. Appl. Math. 34(1-3): 83-105 (1991) - 1990
- [j13]Lane H. Clark, Roger C. Entringer:
The number of cutvertices in graphs with given minimum degree. Discret. Math. 81(2): 137-145 (1990)
1980 – 1989
- 1989
- [j12]Karen Anne Johnson, Roger C. Entringer:
Largest induced subgraphs of the n-cube that contain no 4-cycles. J. Comb. Theory B 46(3): 346-355 (1989) - 1981
- [j11]Curtis A. Barefoot, Roger C. Entringer:
A census of maximum uniquely hamiltonian graphs. J. Graph Theory 5(3): 315-321 (1981) - 1980
- [j10]Lane H. Clark, Roger C. Entringer, Douglas E. Jackson:
Minimum graphs with complete k-closure. Discret. Math. 30(2): 95-101 (1980) - [j9]Roger C. Entringer, Henda C. Swart:
Spanning cycles of nearly cubic graphs. J. Comb. Theory B 29(3): 303-309 (1980) - [j8]Curtis A. Barefoot, Roger C. Entringer:
Extremal maximal uniquely hamiltonian graphs. J. Graph Theory 4(1): 93-100 (1980)
1970 – 1979
- 1979
- [j7]Donald L. Goldsmith, Roger C. Entringer:
A sufficient condition for equality of edge-connectivity and minimum degree of a graph. J. Graph Theory 3(3): 251-255 (1979) - [j6]Kim T. Rawlinson, Roger C. Entringer:
Class of graphs with restricted neighborhoods. J. Graph Theory 3(3): 257-262 (1979) - 1978
- [j5]Roger C. Entringer:
Characterization of maximum critically 2-connected graphs. J. Graph Theory 2(4): 319-327 (1978) - 1974
- [j4]Roger C. Entringer, Larry D. Gassman:
Line-critical point determining and point distinguishing graphs. Discret. Math. 10(1): 43-55 (1974) - [j3]Roger C. Entringer, Douglas E. Jackson, J. A. Schatz:
On Nonrepetitive Sequences. J. Comb. Theory A 16(2): 159-164 (1974) - 1973
- [j2]Roger C. Entringer, Gustavus J. Simmons:
Sums of Valences in Bigraphs. J. Comb. Theory A 14(1): 93-101 (1973) - 1971
- [j1]Roger C. Entringer, Douglas E. Jackson:
Matrices Permutable to * Matrices. J. Comb. Theory A 11(3): 303-306 (1971)
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-06-10 21:21 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:
