Roger C. Entringer

23 papers Journal 23
YearRankTypeTitle / Venue / Authors
2000 J jnl
Average distance, minimum degree, and spanning trees.
J. Graph Theory
Peter Dankelmann, Roger C. Entringer
1997 J jnl
A note on cliques and independent sets.
J. Graph Theory
Roger C. Entringer, Wayne Goddard, Michael A. Henning
1997 J jnl
Extremal Values for Ratios of Distances in Trees.
Discret. Appl. Math.
Curtis A. Barefoot, Roger C. Entringer, László A. Székely
1996 J jnl
Cycle-saturated graphs of minimum size.
Discret. Math.
Curtis A. Barefoot, Lane H. Clark, Roger C. Entringer, T. D. Porter, László A. Székely, Zsolt Tuza
1994 J jnl
On the Wiener index of trees from certain families.
Australas. J Comb.
Roger C. Entringer, Amram Meir, John W. Moon, László A. Székely
1994 J jnl
Subdivision thresholds for two classes of graphs.
Discret. Math.
Curtis A. Barefoot, Lane H. Clark, A. J. Depew, Roger C. Entringer, László A. Székely
1992 J jnl
An inequality for degree sequences.
Discret. Math.
László A. Székely, Lane H. Clark, Roger C. Entringer
1992 J jnl
Smallest maximally nonhamiltonian graphs II.
Graphs Comb.
Lane H. Clark, Roger C. Entringer, Henry D. Shapiro
1991 J jnl
Extremal problems for local properties of graphs.
Australas. J Comb.
Lane H. Clark, Roger C. Entringer, Joseph E. McCanna, László A. Székely
1991 J jnl
Threshold functions for local properties of graphs: triangles.
Discret. Appl. Math.
Lane H. Clark, Roger C. Entringer, László A. Székely
1990 J jnl
The number of cutvertices in graphs with given minimum degree.
Discret. Math.
Lane H. Clark, Roger C. Entringer
1989 J jnl
Largest induced subgraphs of the
J. Comb. Theory B
Karen Anne Johnson, Roger C. Entringer
1981 J jnl
A census of maximum uniquely hamiltonian graphs.
J. Graph Theory
Curtis A. Barefoot, Roger C. Entringer
1980 J jnl
Extremal maximal uniquely hamiltonian graphs.
J. Graph Theory
Curtis A. Barefoot, Roger C. Entringer
1980 J jnl
Minimum graphs with complete k-closure.
Discret. Math.
Lane H. Clark, Roger C. Entringer, Douglas E. Jackson
1980 J jnl
Spanning cycles of nearly cubic graphs.
J. Comb. Theory B
Roger C. Entringer, Henda C. Swart
1979 J jnl
A sufficient condition for equality of edge-connectivity and minimum degree of a graph.
J. Graph Theory
Donald L. Goldsmith, Roger C. Entringer
1979 J jnl
Class of graphs with restricted neighborhoods.
J. Graph Theory
Kim T. Rawlinson, Roger C. Entringer
1978 J jnl
Characterization of maximum critically 2-connected graphs.
J. Graph Theory
Roger C. Entringer
1974 J jnl
Line-critical point determining and point distinguishing graphs.
Discret. Math.
Roger C. Entringer, Larry D. Gassman
1974 J jnl
On Nonrepetitive Sequences.
J. Comb. Theory A
Roger C. Entringer, Douglas E. Jackson, J. A. Schatz
1973 J jnl
Sums of Valences in Bigraphs.
J. Comb. Theory A
Roger C. Entringer, Gustavus J. Simmons
1971 J jnl
Matrices Permutable to * Matrices.
J. Comb. Theory A
Roger C. Entringer, Douglas E. Jackson