Minimum graphs with complete k-closure. - Lane H. Clark; Roger C. Entringer; Douglas E. Jackson (Discret. Math., 1980)

On hamiltonian line graphs. - Lane H. Clark (J. Graph Theory, 1984)

The number of cutvertices in graphs with given minimum degree. - Lane H. Clark; Roger C. Entringer (Discret. Math., 1990)

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)

Threshold functions for local properties of graphs: triangles. - Lane H. Clark; Roger C. Entringer; László A. Székely (Discret. Appl. Math., 1991)

An inequality for degree sequences. - László A. Székely; Lane H. Clark; Roger C. Entringer (Discret. Math., 1992)

Smallest maximally nonhamiltonian graphs II. - Lane H. Clark; Roger C. Entringer; Henry D. Shapiro (Graphs Comb., 1992)

A Linear Time Algorithm for Graph Partition Problems. - Lane H. Clark; Farhad Shahrokhi; László A. Székely (Inf. Process. Lett., 1992)

The minimum number of subgraphs in a graph and its complement. - Lane H. Clark (J. Graph Theory, 1992)

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)

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)

The Number of Orientations of a Tree Admitting an Efficient Dominating Set. - David W. Bange; Anthony E. Barkauskas; Lane H. Clark (Ars Comb., 1997)

On the Maximum Number of Chords in a Cycle of a Graph. - Lane H. Clark; Thomas Dale Porter (Ars Comb., 1997)

Remarks on the size of critical edge-chromatic graphs. - Lane H. Clark; Dawit Haile (Discret. Math., 1997)

Asymptotic Normality of the Generalized Eulerian Numbers. - Lane H. Clark (Ars Comb., 1998)

Parity dimension for graphs. - Ashok T. Amin; Lane H. Clark; Peter J. Slater (Discret. Math., 1998)

Efficient domination of the orientations of a graph. - David W. Bange; Anthony E. Barkauskas; Linda H. Host; Lane H. Clark (Discret. Math., 1998)

On the Steiner distance of trees from certain families. - Lane H. Clark; Amram Meir; John W. Moon (Australas. J Comb., 1999)

On the General Randic Index for Certain Families of Trees. - Lane H. Clark; John W. Moon (Ars Comb., 1999)

Asymptotic normality of the Ward numbers. - Lane H. Clark (Discret. Math., 1999)

An Asymptotic Expansion for the Number of Permutations with a Certain Number of Inversions. - Lane H. Clark (Electron. J. Comb., 2000)

The strong matching number of a random graph. - Lane H. Clark (Australas. J Comb., 2001)

Comment on "Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs without Monochromatic Triangles". - Lane H. Clark (Ars Comb., 2005)

Local extrema in random trees. - Lane H. Clark (Int. J. Math. Math. Sci., 2005)

Comment on "The Expectation Of Independent Domination Number Over Random Binary Trees". - Lane H. Clark; J. P. McSorley (Ars Comb., 2008)

Multiplicities of Integer Arrays. - Lane H. Clark (Integers, 2010)

The independent domination number of a random graph. - Lane H. Clark; Darin Johnson (Discuss. Math. Graph Theory, 2011)

The Distribution of Ramsey Numbers - Lane H. Clark; Frank Gaitan (CoRR, 2013)

Graph isomorphism and adiabatic quantum computing - Frank Gaitan; Lane H. Clark (CoRR, 2013)

On The Tree Domination Number Of A Random Graph. - Lane H. Clark; Darin Johnson (Ars Comb., 2015)

Generalized Ramsey numbers through adiabatic quantum optimization. - Mani Ranjbar; William G. Macready; Lane H. Clark; Frank Gaitan (Quantum Inf. Process., 2016)