Roger C. Entringer

According to our database, Roger C. Entringer authored at least 23 papers between 1971 and 2000.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2000

Average distance, minimum degree, and spanning trees.

Peter Dankelmann, Roger C. Entringer

J. Graph Theory, 2000

1997

A note on cliques and independent sets.

Roger C. Entringer, Wayne Goddard, Michael A. Henning

J. Graph Theory, 1997

Extremal Values for Ratios of Distances in Trees.

Curtis A. Barefoot, Roger C. Entringer, László A. Székely

Discret. Appl. Math., 1997

1996

Cycle-saturated graphs of minimum size.

Curtis A. Barefoot, Lane H. Clark, Roger C. Entringer, T. D. Porter, László A. Székely, Zsolt Tuza

Discret. Math., 1996

1994

Subdivision thresholds for two classes of graphs.

Curtis A. Barefoot, Lane H. Clark, A. J. Depew, Roger C. Entringer, László A. Székely

Discret. Math., 1994

On the Wiener index of trees from certain families.

Roger C. Entringer, Amram Meir, John W. Moon, László A. Székely

Australas. J Comb., 1994

1992

Smallest maximally nonhamiltonian graphs II.

Lane H. Clark, Roger C. Entringer, Henry D. Shapiro

Graphs Comb., 1992

An inequality for degree sequences.

László A. Székely, Lane H. Clark, Roger C. Entringer

Discret. Math., 1992

1991

Threshold functions for local properties of graphs: triangles.

Lane H. Clark, Roger C. Entringer, László A. Székely

Discret. Appl. Math., 1991

Extremal problems for local properties of graphs.

Lane H. Clark, Roger C. Entringer, Joseph E. McCanna, László A. Székely

Australas. J Comb., 1991

1990

The number of cutvertices in graphs with given minimum degree.

Lane H. Clark, Roger C. Entringer

Discret. Math., 1990

1989

Largest induced subgraphs of the <i>n</i>-cube that contain no 4-cycles.

Karen Anne Johnson, Roger C. Entringer

J. Comb. Theory B, 1989

1981

A census of maximum uniquely hamiltonian graphs.

Curtis A. Barefoot, Roger C. Entringer

J. Graph Theory, 1981

1980

Extremal maximal uniquely hamiltonian graphs.

Curtis A. Barefoot, Roger C. Entringer

J. Graph Theory, 1980

Spanning cycles of nearly cubic graphs.

Roger C. Entringer, Henda C. Swart

J. Comb. Theory B, 1980

Minimum graphs with complete k-closure.

Lane H. Clark, Roger C. Entringer, Douglas E. Jackson

Discret. Math., 1980

1979

Class of graphs with restricted neighborhoods.

Kim T. Rawlinson, Roger C. Entringer

J. Graph Theory, 1979

A sufficient condition for equality of edge-connectivity and minimum degree of a graph.

Donald L. Goldsmith, Roger C. Entringer

J. Graph Theory, 1979

1978

Characterization of maximum critically 2-connected graphs.

Roger C. Entringer

J. Graph Theory, 1978

1974

On Nonrepetitive Sequences.

Roger C. Entringer, Douglas E. Jackson, J. A. Schatz

J. Comb. Theory A, 1974

Line-critical point determining and point distinguishing graphs.

Roger C. Entringer, Larry D. Gassman

Discret. Math., 1974

1973

Sums of Valences in Bigraphs.

Roger C. Entringer, Gustavus J. Simmons

J. Comb. Theory A, 1973

1971

Matrices Permutable to * Matrices.

Roger C. Entringer, Douglas E. Jackson

J. Comb. Theory A, 1971