Lane H. Clark

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