Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Roger C. Entringer
Observed names:
Entringer, Roger C.,
R. C. Entringer,
R. Entringer,
R.C Entringer,
R.C. Entringer,
Roger Entringer
show all 6
Observed institutions:
Center for Naval Analyses,
University of New Mexico,
Sandia National Laboratories,
Hungarian Academy of Sciences,
Texas A&M University
OpenAlex ID:
A5002305154
Wiener Index of Trees: Theory and Applications
2001
·
Andrey A. Dobrynin
, Roger Entringer
, et al.
·
Acta Applicandae Mathematicae
·
998
Distance in graphs
1976
·
Roger C. Entringer
, D. E. Jackson
, et al.
·
Czechoslovak Mathematical Journal
·
367
On nonrepetitive sequences
1974
·
R.C Entringer
, D.E Jackson
, et al.
·
Journal of Combinatorial Theory Series A
·
89
Average distance, minimum degree, and spanning trees
2000
·
Peter Dankelmann
, Roger Entringer
·
Journal of Graph Theory
·
54
Largest induced subgraphs of the n-cube that contain no 4-cycles
1989
·
Karen Anne Johnson
, Roger Entringer
·
Journal of Combinatorial Theory Series B
·
51
Smallest maximally nonhamiltonian graphs
1983
·
L. Clark
, R. Entringer
·
Periodica Mathematica Hungarica
·
48
Arc Colorings of Digraphs
1972
·
C.C Harner
, R.C Entringer
·
Journal of Combinatorial Theory Series B
·
43
Extremal values for ratios of distances in trees
1997
·
C.A. Barefoot
, R.C. Entringer
, et al.
·
Discrete Applied Mathematics
·
41
Gossips and telegraphs
1979
·
Roger C. Entringer
, Peter J. Slater
·
Journal of the Franklin Institute
·
41
On the Wiener Index of Trees From Certain Families
1994
·
R. C. Entringer
, A. Meir
, et al.
·
34
Spanning cycles of nearly cubic graphs
1980
·
R.C Entringer
, Henda Swart
·
Journal of Combinatorial Theory Series B
·
33
Geodetic connectivity of graphs
1977
·
R. Entringer
, D. Jackson
, et al.
·
IEEE Transactions on Circuits and Systems
·
33
On permutations containing no long arithmetic progressions
1977
·
J. Davis
, R. Entringer
, et al.
·
Acta Arithmetica
·
31
Cycle-saturated graphs of minimum size
1996
·
C.A. Barefoot
, L.H. Clark
, et al.
·
Discrete Mathematics
·
28
PDF
Smallest maximally nonhamiltonian graphs II
1992
·
L. H. Clark
, R. C. Entringer
, et al.
·
Graphs and Combinatorics
·
27
An inequality for degree sequences
1992
·
L.A. Székely
, L.H. Clark
, et al.
·
Discrete Mathematics
·
27
Enumeration of permutations of (1,…,n) by number of maxima
1969
·
R. C. Entringer
·
Duke Mathematical Journal
·
25
The bisection width of cubic graphs
1989
·
L.H. Clark
, R.C. Entringer
·
Bulletin of the Australian Mathematical Society
·
19
PDF
Line-critical point determining and point distinguishing graphs
1974
·
R.C. Entringer
, Larry D. Gassman
·
Discrete Mathematics
·
17
A sufficient condition for equality of edge‐connectivity and minimum degree of a graph
1979
·
Donald L. Goldsmith
, Roger C. Entringer
·
Journal of Graph Theory
·
16
Extremal problems for local properties of graphs.
1991
·
Lane Clark
, R. C. Entringer
, et al.
·
Australas. J Comb.
·
13
A note on cliques and independent sets
1997
·
Roger C. Entringer
, Wayne Goddard
, et al.
·
Journal of Graph Theory
·
12
Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
1980
·
J. A. Bondy
, R. C. Entringer
·
Canadian Journal of Mathematics
·
12
PDF
Representation of m as
1968
·
R. C. Entringer
·
Canadian Mathematical Bulletin
·
12
PDF
New Tricks for Old Trees: Maps and the Pigeonhole Principle
1994
·
N. Graham
, R. C. Entringer
, et al.
·
American Mathematical Monthly
·
11
Show more works
View as search
Works count:
65
Citation count:
2,208
H-index:
18
I10-index:
26
Year
Topic
Type