Roger C. Entringer - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 23 from 23

2000

Average distance, minimum degree, and spanning treesPeter Dankelmann, Roger C. Entringer. jgt, 33(1):1-13, 2000. [doi]

1997

Extremal Values for Ratios of Distances in TreesCurtis A. Barefoot, Roger C. Entringer, László A. Székely. DAM, 80(1):37-56, 1997. [doi]

A note on cliques and independent setsRoger C. Entringer, Wayne Goddard, Michael A. Henning. jgt, 24(1):21-23, 1997. [doi]

1996

Cycle-saturated graphs of minimum sizeCurtis A. Barefoot, L. H. Clark, Roger C. Entringer, T. D. Porter, László A. Székely, Zsolt Tuza. DM, 150(1-3):31-48, 1996. [doi]

1994

Subdivision thresholds for two classes of graphsCurtis A. Barefoot, L. H. Clark, A. J. Depew, Roger C. Entringer, László A. Székely. DM, 125(1-3):15-30, 1994. [doi]

On the Wiener index of trees from certain familiesRoger C. Entringer, Amram Meir, John W. Moon, László A. Székely. ajc, 10:211-224, 1994. [doi]

1992

Smallest maximally nonhamiltonian graphs IIL. H. Clark, Roger C. Entringer, H. D. Shapiro. gc, 8(3):225-231, 1992. [doi]

An inequality for degree sequencesLászló A. Székely, L. H. Clark, Roger C. Entringer. DM, 103(3):293-300, 1992. [doi]

1991

Threshold functions for local properties of graphs: trianglesL. H. Clark, Roger C. Entringer, László A. Székely. DAM, 34(1-3):83-105, 1991. [doi]

Extremal problems for local properties of graphsLane H. Clark, Roger C. Entringer, Joseph E. McCanna, László A. Székely. ajc, 4:25-32, 1991. [doi]

1990

The number of cutvertices in graphs with given minimum degreeL. H. Clark, Roger C. Entringer. DM, 81(2):137-145, 1990. [doi]

1989

Largest induced subgraphs of the ::::n::::-cube that contain no 4-cyclesKaren Anne Johnson, Roger C. Entringer. JCT, 46(3):346-355, 1989. [doi]

1981

A census of maximum uniquely hamiltonian graphsCurtis A. Barefoot, Roger C. Entringer. jgt, 5(3):315-321, 1981. [doi]

1980

Extremal maximal uniquely hamiltonian graphsCurtis A. Barefoot, Roger C. Entringer. jgt, 4(1):93-100, 1980. [doi]

Minimum graphs with complete k-closureL. H. Clark, Roger C. Entringer, Douglas E. Jackson. DM, 30(2):95-101, 1980. [doi]

Spanning cycles of nearly cubic graphsRoger C. Entringer, Henda C. Swart. JCT, 29(3):303-309, 1980. [doi]

1979

A sufficient condition for equality of edge-connectivity and minimum degree of a graphDonald L. Goldsmith, Roger C. Entringer. jgt, 3(3):251-255, 1979. [doi]

Class of graphs with restricted neighborhoodsKim T. Rawlinson, Roger C. Entringer. jgt, 3(3):257-262, 1979. [doi]

1978

Characterization of maximum critically 2-connected graphsRoger C. Entringer. jgt, 2(4):319-327, 1978. [doi]

1974

On Nonrepetitive SequencesRoger C. Entringer, Douglas E. Jackson. JCT, 16(2):159-164, 1974.

Line-critical point determining and point distinguishing graphsRoger C. Entringer, Larry D. Gassman. DM, 10(1):43-55, 1974. [doi]

1973

Sums of Valences in BigraphsRoger C. Entringer, G. J. Simmons. JCT, 14(1):93-101, 1973.

1971

Matrices Permutable to * MatricesRoger C. Entringer, Douglas E. Jackson. JCT, 11(3):303-306, 1971.

Sign in or sign up to see more results.

runs on WebDSL