Lane H. Clark

发表

Cycle-saturated graphs of minimum size

Zsolt Tuza, Curtis A. Barefoot, Lane H. Clark, 1996, Discret. Math..

Smallest maximally nonhamiltonian graphs II

Lane H. Clark, Roger C. Entringer, H. D. Shapiro, 1992, Graphs Comb..

On The Tree Domination Number Of A Random Graph

Lane H. Clark, Darin Johnson, 2015, Ars Comb..

The Distribution of Ramsey Numbers pdf

Lane H. Clark, Frank Gaitan, L. Clark, 2013, ArXiv.

A Linear Time Algorithm for Graph Partition Problems

Farhad Shahrokhi, Lane H. Clark, László A. Székely, 1992, Inf. Process. Lett..

Local extrema in random trees

Lane H. Clark, 2005, Int. J. Math. Math. Sci..

On the General Randic Index for Certain Families of Trees

Lane H. Clark, John W. Moon, 1999, Ars Comb..

The strong matching number of a random graph

Lane H. Clark, 2001, Australas. J Comb..

The number of cutvertices in graphs with given minimum degree

Lane H. Clark, Roger C. Entringer, 1990, Discret. Math..

Remarks on the size of critical edge-chromatic graphs

Lane H. Clark, Dawit Haile, L. Clark, 1997, Discret. Math..

Comment on "The Expectation Of Independent Domination Number Over Random Binary Trees"

Lane H. Clark, J. P. McSorley, 2008, Ars Comb..

Minimum graphs with complete k-closure

Lane H. Clark, Roger C. Entringer, Douglas E. Jackson, 1980, Discret. Math..

Comment on "Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs without Monochromatic Triangles"

Lane H. Clark, 2005, Ars Comb..

On hamiltonian line graphs

Lane H. Clark, 1984, J. Graph Theory.

Efficient domination of the orientations of a graph

Lane H. Clark, David W. Bange, Anthony E. Barkauskas, 1998, Discret. Math..

The minimum number of subgraphs in a graph and its complement

Lane H. Clark, 1992, J. Graph Theory.

An inequality for degree sequences

Lane H. Clark, Roger C. Entringer, László A. Székely, 1992, Discret. Math..

The Number of Orientations of a Tree Admitting an Efficient Dominating Set

Lane H. Clark, David W. Bange, Anthony E. Barkauskas, 1997, Ars Comb..

Extremal problems for local properties of graphs

Lane H. Clark, Roger C. Entringer, László A. Székely, 1991, Australas. J Comb..

An Asymptotic Expansion for the Number of Permutations with a Certain Number of Inversions

Lane H. Clark, L. Clark, 2000, Electron. J. Comb..

On the Steiner distance of trees from certain families

Lane H. Clark, John W. Moon, Amram Meir, 1999, Australas. J Comb..

On the Maximum Number of Chords in a Cycle of a Graph

Lane H. Clark, Thomas Dale Porter, 1997, Ars Comb..

Graph isomorphism and adiabatic quantum computing pdf

Lane H. Clark, Frank Gaitan, L. Clark, 2013, ArXiv.

Threshold functions for local properties of graphs: triangles

Lane H. Clark, Roger C. Entringer, László A. Székely, 1991, Discret. Appl. Math..

Asymptotic normality of the Ward numbers

Lane H. Clark, L. Clark, 1999, Discret. Math..

Parity dimension for graphs

Peter J. Slater, Lane H. Clark, Ashok T. Amin, 1998, Discret. Math..

Asymptotic Normality of the Generalized Eulerian Numbers

Lane H. Clark, 1998, Ars Comb..

Generalized Ramsey numbers through adiabatic quantum optimization

Lane H. Clark, Frank Gaitan, William G. Macready, 2016, Quantum Inf. Process..

The independent domination number of a random graph

Lane H. Clark, Darin Johnson, L. Clark, 2011, Discuss. Math. Graph Theory.

Algorithms for learning and teaching sets of vertices in graphs

Michael R. Fellows, Lane H. Clark, Patricia A. Evans, 1994 .

Experimental determination of Ramsey numbers with quantum annealing

Fabián A. Chudak, Lane H. Clark, Frank Gaitan, 2012 .

Exponent-dependent properties of the connectivity index

Lane H. Clark, Mirko Lepovic, Ivan Gutman, 2002 .