Lane H. Clark

Publication Activity (10 Years)

Years Active: 1980-2016
Publications (10 Years): 2

Top Topics

Optimization Procedure

Graph Isomorphism

Quantum Computing

Top Venues

Quantum Inf. Process.

Publications

Mani Ranjbar, William G. Macready, Lane H. Clark, Frank Gaitan
Generalized Ramsey numbers through adiabatic quantum optimization. Quantum Inf. Process. 15 (9) (2016)
Lane H. Clark, Darin Johnson
On The Tree Domination Number Of A Random Graph. Ars Comb. 118 (2015)
Frank Gaitan, Lane H. Clark
Graph isomorphism and adiabatic quantum computing CoRR (2013)
Lane H. Clark, Frank Gaitan
The Distribution of Ramsey Numbers CoRR (2013)
Lane H. Clark, Darin Johnson
The independent domination number of a random graph. Discuss. Math. Graph Theory 31 (1) (2011)
Lane H. Clark
Multiplicities of Integer Arrays. Integers 10 (2010)
Lane H. Clark, J. P. McSorley
Comment on "The Expectation Of Independent Domination Number Over Random Binary Trees". Ars Comb. 87 (2008)
Lane H. Clark
Comment on "Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs without Monochromatic Triangles". Ars Comb. 76 (2005)
Lane H. Clark
Local extrema in random trees. Int. J. Math. Math. Sci. 2005 (23) (2005)
Lane H. Clark
The strong matching number of a random graph. Australas. J Comb. 24 (2001)
Lane H. Clark
An Asymptotic Expansion for the Number of Permutations with a Certain Number of Inversions. Electron. J. Comb. 7 (2000)
Lane H. Clark, John W. Moon
On the General Randic Index for Certain Families of Trees. Ars Comb. 54 (1999)
Lane H. Clark
Asymptotic normality of the Ward numbers. Discret. Math. 203 (1-3) (1999)
Lane H. Clark, Amram Meir, John W. Moon
On the Steiner distance of trees from certain families. Australas. J Comb. 20 (1999)
Ashok T. Amin, Lane H. Clark, Peter J. Slater
Parity dimension for graphs. Discret. Math. 187 (1-3) (1998)
David W. Bange, Anthony E. Barkauskas, Linda H. Host, Lane H. Clark
Efficient domination of the orientations of a graph. Discret. Math. 178 (1-3) (1998)
Lane H. Clark
Asymptotic Normality of the Generalized Eulerian Numbers. Ars Comb. 48 (1998)
Lane H. Clark, Thomas Dale Porter
On the Maximum Number of Chords in a Cycle of a Graph. Ars Comb. 46 (1997)
Lane H. Clark, Dawit Haile
Remarks on the size of critical edge-chromatic graphs. Discret. Math. 171 (1-3) (1997)
David W. Bange, Anthony E. Barkauskas, Lane H. Clark
The Number of Orientations of a Tree Admitting an Efficient Dominating Set. Ars Comb. 45 (1997)
Curtis A. Barefoot, Lane H. Clark, Roger C. Entringer, T. D. Porter, László A. Székely, Zsolt Tuza
Cycle-saturated graphs of minimum size. Discret. Math. 150 (1-3) (1996)
Curtis A. Barefoot, Lane H. Clark, A. J. Depew, Roger C. Entringer, László A. Székely
Subdivision thresholds for two classes of graphs. Discret. Math. 125 (1-3) (1994)
Lane H. Clark, Roger C. Entringer, Henry D. Shapiro
Smallest maximally nonhamiltonian graphs II. Graphs Comb. 8 (3) (1992)
Lane H. Clark
The minimum number of subgraphs in a graph and its complement. J. Graph Theory 16 (5) (1992)
Lane H. Clark, Farhad Shahrokhi, László A. Székely
A Linear Time Algorithm for Graph Partition Problems. Inf. Process. Lett. 42 (1) (1992)
László A. Székely, Lane H. Clark, Roger C. Entringer
An inequality for degree sequences. Discret. Math. 103 (3) (1992)
Lane H. Clark, Roger C. Entringer, Joseph E. McCanna, László A. Székely
Extremal problems for local properties of graphs. Australas. J Comb. 4 (1991)
Lane H. Clark, Roger C. Entringer, László A. Székely
Threshold functions for local properties of graphs: triangles. Discret. Appl. Math. 34 (1-3) (1991)
Lane H. Clark, Roger C. Entringer
The number of cutvertices in graphs with given minimum degree. Discret. Math. 81 (2) (1990)
Lane H. Clark
On hamiltonian line graphs. J. Graph Theory 8 (2) (1984)
Lane H. Clark, Roger C. Entringer, Douglas E. Jackson
Minimum graphs with complete k-closure. Discret. Math. 30 (2) (1980)