Extremal values for ratios of distances in trees von Barefoot, C.A., Entringer, R.C., Székely, L.A.

Volltext

Cycle-saturated graphs of minimum size von Barefoot, C.A., Clark, L.H., Entringer, R.C., Porter, T.D., Székely, L.A., Tuza, Zs

Volltext

An inequality for degree sequences von Székely, L.A., Clark, L.H., Entringer, R.C.

Volltext

Computer based proofs by induction in graph theory— a house of cards? von Barefoot, C.A., Entringer, R.C., Mullhaupt, A.P.

Volltext

The number of cutvertices in graphs with given minimum degree von Clark, L.H., Entringer, R.C.

Volltext

Subdivision thresholds for two classes of graphs von Barefoot, C.A., Clark, L.H., Depew, A.J., Entringer, R.C., Székely, L.A.

Volltext

Threshold functions for local properties of graphs: triangles von Clark, L.H., Entringer, R.C., Székely, L.A.

Volltext

A Short Proof of Rubin's Block Theorem von Entringer, R.C.

Volltext

The bisection width of cubic graphs von Clark, L.H., Entringer, R.C.

Volltext

Spanning cycles of nearly cubic graphs von Entringer, R.C, Swart, Henda

Volltext

On the number of unique subgraphs of a graph von Entringer, R.C, Erdös, Paul

Volltext

Line-critical point determining and point distinguishing graphs von Entringer, R.C., Gassman, Larry D.

Volltext

On nonrepetitive sequences von Entringer, R.C, Jackson, D.E, Schatz, J.A

Volltext

Sums of valences in bigraphs von Entringer, R.C, Simmons, G.J

Volltext

Maximal component-complete subgraphs von Entringer, R.C, Harner, C.C

Volltext

Arc Colorings of Digraphs von Harner, C.C, Entringer, R.C

Volltext

Minimum graphs with complete k-closure von Clark, L., Entringer, R.C., Jackson, D.E.

Volltext

Enumeration of certain binary matrices von Jackson, Douglas E., Entringer, R.C.

Volltext

Matrices permutable to ∗ matrices von Entringer, R.C, Jackson, Douglas E

Volltext

Geodetic connectivity of graphs von Entringer, R., Jackson, D., Slater, P.

Volltext