A note on path-perfect graphs. - John Frederick Fink; H. Joseph Straight (Discret. Math., 1981)

Randomly antitraceable digraphs. - John Frederick Fink (J. Graph Theory, 1982)

On smallest regular graphs with a given isopart. - John Frederick Fink (J. Graph Theory, 1985)

The bondage number of a graph. - John Frederick Fink; Michael S. Jacobson; Lael F. Kinch; John Roberts (Discret. Math., 1990)

On the decomposition of n-cubes into isomorphic trees. - John Frederick Fink (J. Graph Theory, 1990)

On the Decomposition of Cayley Color Graphs into Isomorphic Oriented Trees. - John Frederick Fink (J. Comb. Theory B, 1994)

Convexity in oriented graphs. - Gary Chartrand; John Frederick Fink; Ping Zhang 004 (Discret. Appl. Math., 2002)

Remarks on Distance Distributions for Graphs Modeling Computer Networks. - Bruce S. Elenbogen; John Frederick Fink (Electron. Notes Discret. Math., 2002)

Distance distributions for graphs modeling computer networks. - Bruce S. Elenbogen; John Frederick Fink (Discret. Appl. Math., 2007)

A Generating Function Approach to Network Analysis. - Bruce S. Elenbogen; John Frederick Fink (Int. J. Comput. Their Appl., 2012)