Roger C. Entringer

Publication Activity (10 Years)

Years Active: 1971-2000
Publications (10 Years): 0

Publications

Peter Dankelmann, Roger C. Entringer
Average distance, minimum degree, and spanning trees. J. Graph Theory 33 (1) (2000)
Curtis A. Barefoot, Roger C. Entringer, László A. Székely
Extremal Values for Ratios of Distances in Trees. Discret. Appl. Math. 80 (1) (1997)
Roger C. Entringer, Wayne Goddard, Michael A. Henning
A note on cliques and independent sets. J. Graph Theory 24 (1) (1997)
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) (1996)
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 (1994)
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) (1994)
Lane H. Clark, Roger C. Entringer, Henry D. Shapiro
Smallest maximally nonhamiltonian graphs II. Graphs Comb. 8 (3) (1992)
László A. Székely, Lane H. Clark, Roger C. Entringer
An inequality for degree sequences. Discret. Math. 103 (3) (1992)
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 (1991)
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) (1991)
Lane H. Clark, Roger C. Entringer
The number of cutvertices in graphs with given minimum degree. Discret. Math. 81 (2) (1990)
Karen Anne Johnson, Roger C. Entringer
-cube that contain no 4-cycles. J. Comb. Theory, Ser. B 46 (3) (1989)
Curtis A. Barefoot, Roger C. Entringer
A census of maximum uniquely hamiltonian graphs. J. Graph Theory 5 (3) (1981)
Roger C. Entringer, Henda C. Swart
Spanning cycles of nearly cubic graphs. J. Comb. Theory, Ser. B 29 (3) (1980)
Lane H. Clark, Roger C. Entringer, Douglas E. Jackson
Minimum graphs with complete k-closure. Discret. Math. 30 (2) (1980)
Curtis A. Barefoot, Roger C. Entringer
Extremal maximal uniquely hamiltonian graphs. J. Graph Theory 4 (1) (1980)
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) (1979)
Kim T. Rawlinson, Roger C. Entringer
Class of graphs with restricted neighborhoods. J. Graph Theory 3 (3) (1979)
Roger C. Entringer
Characterization of maximum critically 2-connected graphs. J. Graph Theory 2 (4) (1978)
Roger C. Entringer, Douglas E. Jackson, J. A. Schatz
On Nonrepetitive Sequences. J. Comb. Theory, Ser. A 16 (2) (1974)
Roger C. Entringer, Larry D. Gassman
Line-critical point determining and point distinguishing graphs. Discret. Math. 10 (1) (1974)
Roger C. Entringer, Gustavus J. Simmons
Sums of Valences in Bigraphs. J. Comb. Theory, Ser. A 14 (1) (1973)
Roger C. Entringer, Douglas E. Jackson
Matrices Permutable to * Matrices. J. Comb. Theory, Ser. A 11 (3) (1971)