default search action
Lane H. Clark
Person information
- affiliation: Southern Illinois University, Department of Mathematics, Carbondale, IL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j29]Mani Ranjbar, William G. Macready, Lane H. Clark, Frank Gaitan
:
Generalized Ramsey numbers through adiabatic quantum optimization. Quantum Inf. Process. 15(9): 3519-3542 (2016) - 2015
- [j28]Lane H. Clark, Darin Johnson:
On The Tree Domination Number Of A Random Graph. Ars Comb. 118: 227-241 (2015) - 2013
- [i2]Lane H. Clark, Frank Gaitan:
The Distribution of Ramsey Numbers. CoRR abs/1303.3793 (2013) - [i1]Frank Gaitan, Lane H. Clark:
Graph isomorphism and adiabatic quantum computing. CoRR abs/1304.5773 (2013) - 2011
- [j27]Lane H. Clark, Darin Johnson:
The independent domination number of a random graph. Discuss. Math. Graph Theory 31(1): 129-142 (2011) - 2010
- [j26]Lane H. Clark:
Multiplicities of Integer Arrays. Integers 10: A14 (2010)
2000 – 2009
- 2008
- [j25]Lane H. Clark, J. P. McSorley:
Comment on "The Expectation Of Independent Domination Number Over Random Binary Trees". Ars Comb. 87 (2008) - 2005
- [j24]Lane H. Clark:
Comment on "Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs without Monochromatic Triangles". Ars Comb. 76 (2005) - [j23]Lane H. Clark:
Local extrema in random trees. Int. J. Math. Math. Sci. 2005(23): 3867-3882 (2005) - 2001
- [j22]Lane H. Clark:
The strong matching number of a random graph. Australas. J Comb. 24: 47-58 (2001) - 2000
- [j21]Lane H. Clark:
An Asymptotic Expansion for the Number of Permutations with a Certain Number of Inversions. Electron. J. Comb. 7 (2000)
1990 – 1999
- 1999
- [j20]Lane H. Clark, Amram Meir, John W. Moon:
On the Steiner distance of trees from certain families. Australas. J Comb. 20: 47-68 (1999) - [j19]Lane H. Clark, John W. Moon:
On the General Randic Index for Certain Families of Trees. Ars Comb. 54 (1999) - [j18]Lane H. Clark:
Asymptotic normality of the Ward numbers. Discret. Math. 203(1-3): 41-48 (1999) - 1998
- [j17]Lane H. Clark:
Asymptotic Normality of the Generalized Eulerian Numbers. Ars Comb. 48 (1998) - [j16]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): 1-14 (1998) - [j15]Ashok T. Amin, Lane H. Clark, Peter J. Slater:
Parity dimension for graphs. Discret. Math. 187(1-3): 1-17 (1998) - 1997
- [j14]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) - [j13]Lane H. Clark, Thomas Dale Porter:
On the Maximum Number of Chords in a Cycle of a Graph. Ars Comb. 46 (1997) - [j12]Lane H. Clark, Dawit Haile:
Remarks on the size of critical edge-chromatic graphs. Discret. Math. 171(1-3): 287-293 (1997) - 1996
- [j11]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): 31-48 (1996) - 1994
- [j10]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): 15-30 (1994) - 1992
- [j9]László A. Székely, Lane H. Clark, Roger C. Entringer:
An inequality for degree sequences. Discret. Math. 103(3): 293-300 (1992) - [j8]Lane H. Clark, Roger C. Entringer, Henry D. Shapiro:
Smallest maximally nonhamiltonian graphs II. Graphs Comb. 8(3): 225-231 (1992) - [j7]Lane H. Clark, Farhad Shahrokhi, László A. Székely:
A Linear Time Algorithm for Graph Partition Problems. Inf. Process. Lett. 42(1): 19-24 (1992) - [j6]Lane H. Clark:
The minimum number of subgraphs in a graph and its complement. J. Graph Theory 16(5): 451-458 (1992) - 1991
- [j5]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: 25-32 (1991) - [j4]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): 83-105 (1991) - 1990
- [j3]Lane H. Clark, Roger C. Entringer:
The number of cutvertices in graphs with given minimum degree. Discret. Math. 81(2): 137-145 (1990)
1980 – 1989
- 1984
- [j2]Lane H. Clark:
On hamiltonian line graphs. J. Graph Theory 8(2): 303-307 (1984) - 1980
- [j1]Lane H. Clark, Roger C. Entringer, Douglas E. Jackson:
Minimum graphs with complete k-closure. Discret. Math. 30(2): 95-101 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: