default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLinda M. Lesniak
Person information
- affiliation: Drew University, Madison, USA
- affiliation: Western Michigan University, Kalamazoo, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j43]Linda M. Lesniak, Henri Thuiller, Adam Pawel Wojda:
Extending Poto?nik and ?ajna's conditions on the existence of vertex-transitive self-complementary k-hypergraphs. Discuss. Math. Graph Theory 43(1): 225-231 (2023)- 2022
- [j42]Douglas Bauer
, Linda M. Lesniak, Edward F. Schmeichel:
A generalization of a theorem of Nash-Williams. Graphs Comb. 38(6): 184 (2022) - 2020
- [j41]Douglas Bauer, Linda M. Lesniak, Aori Nevo, Edward F. Schmeichel:
On the necessity of Chvátal's Hamiltonian degree condition. AKCE Int. J. Graphs Comb. 17(2): 665-669 (2020)
2010 – 2019
- 2018
- [j40]Daniela Ferrero, Linda M. Lesniak:
Chorded Pancyclicity in k-Partite Graphs. Graphs Comb. 34(6): 1565-1580 (2018) - 2016
- [j39]Andrzej Dudek, Linda M. Lesniak:
The vertex size-Ramsey number. Discret. Math. 339(6): 1753-1762 (2016) - 2013
- [j38]Shinya Fujita, Linda M. Lesniak:
Revisit of Erdős-Gallai's theorem on the circumference of a graph. Inf. Process. Lett. 113(17): 646-648 (2013)
2000 – 2009
- 2009
- [j37]Ralph J. Faudree, Linda M. Lesniak, Ingo Schiermeyer:
On the circumference of a graph and its complement. Discret. Math. 309(19): 5891-5893 (2009) - [j36]Eddie Cheng, Linda M. Lesniak, Marc J. Lipman, László Lipták:
Conditional matching preclusion sets. Inf. Sci. 179(8): 1092-1101 (2009) - 2008
- [j35]Gary Chartrand, Linda M. Lesniak, Donald W. VanderJagt, Ping Zhang:
Recognizable colorings of graphs. Discuss. Math. Graph Theory 28(1): 35-57 (2008) - [j34]Eddie Cheng, Linda M. Lesniak, Marc J. Lipman, László Lipták:
Matching preclusion for Alternating Group Graphs and their Generalizations. Int. J. Found. Comput. Sci. 19(6): 1413-1437 (2008) - 2005
- [j33]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito:
A note on 2-factors with two components. Discret. Math. 300(1-3): 218-224 (2005) - [j32]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Minimal Degree and (k, m)-Pancyclic Ordered Graphs. Graphs Comb. 21(2): 197-211 (2005) - 2004
- [j31]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito:
Toughness, degrees and 2-factors. Discret. Math. 286(3): 245-249 (2004) - [j30]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Florian Pfender:
Linear forests and ordered cycles. Discuss. Math. Graph Theory 24(3): 359-372 (2004) - [j29]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Generalizing Pancyclic and k-Ordered Graphs. Graphs Comb. 20(3): 291-309 (2004) - 2003
- [j28]Ralph J. Faudree, Ronald J. Gould, Alexandr V. Kostochka, Linda M. Lesniak, Ingo Schiermeyer, Akira Saito:
Degree conditions for k-ordered hamiltonian graphs. J. Graph Theory 42(3): 199-210 (2003) - 2002
- [j27]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Characterizing forbidden clawless triples implying hamiltonian graphs. Discret. Math. 249(1-3): 71-81 (2002) - 2000
- [j26]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Cycles in 2-Factors of Balanced Bipartite Graphs. Graphs Comb. 16(1): 67-80 (2000) - [j25]Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
On k-ordered graphs. J. Graph Theory 35(2): 69-82 (2000)
1990 – 1999
- 1997
- [j24]Stephan Brandt, Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak:
Degree conditions for 2-factors. J. Graph Theory 24(2): 165-173 (1997) - 1996
- [j23]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak:
Graph spectra. Discret. Math. 150(1-3): 103-113 (1996) - 1995
- [j22]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Degree conditions and cycle extendability. Discret. Math. 141(1-3): 109-122 (1995) - [j21]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Spanning caterpllars with bounded diameter. Discuss. Math. Graph Theory 15(2): 111-118 (1995) - [j20]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Hamiltonicity in balancedk-partite graphs. Graphs Comb. 11(3): 221-231 (1995) - [j19]Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak, Terri Lindquester:
Generalized degree conditions for graphs with bounded independence number. J. Graph Theory 19(3): 397-409 (1995) - 1994
- [j18]Ralph J. Faudree, Richard H. Schelp, Linda M. Lesniak, András Gyárfás, Jenö Lehel:
On the rotation distance of graphs. Discret. Math. 126(1-3): 121-135 (1994) - 1993
- [j17]Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak:
Ø-Threshold and Ø-Tolerance Chain Graphs. Discret. Appl. Math. 44(1-3): 191-203 (1993) - [j16]Nathaniel Dean, Linda M. Lesniak, Akira Saito:
Cycles of length 0 modulo 4 in graphs. Discret. Math. 121(1-3): 37-49 (1993) - [j15]Ralph J. Faudree, András Gyárfás, Linda M. Lesniak, Richard H. Schelp:
Rainbow coloring the cube. J. Graph Theory 17(5): 607-612 (1993) - 1992
- [j14]Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak:
Generalized Degrees and Menger Path Systems. Discret. Appl. Math. 37/38: 179-191 (1992) - [j13]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Terri Lindquester:
On independent generalized degrees and independence numbers in K(1, m)-free graphs. Discret. Math. 103(1): 17-24 (1992) - [j12]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Neighborhood unions and a generalization of Dirac's theorem. Discret. Math. 105(1-3): 61-71 (1992) - 1991
- [j11]Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak:
Neighborhood conditions and edge-disjoint perfect matchings. Discret. Math. 91(1): 33-43 (1991) - 1990
- [j10]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Lower bounds for lower Ramsey numbers. J. Graph Theory 14(6): 723-730 (1990)
1980 – 1989
- 1989
- [j9]Ralph J. Faudree, Michael S. Jacobson, Ronald J. Gould, Linda M. Lesniak:
On a Neighborhood Condition Implying the Existence of Disjoint Complete Graphs. Eur. J. Comb. 10(5): 427-433 (1989) - [j8]Linda M. Lesniak, Raymond E. Pippert:
On the edge-connectivity vector of a graph. Networks 19(6): 667-671 (1989) - 1986
- [b1]Gary Chartrand, Linda M. Lesniak:
Graphs and digraphs (2. ed.). Wadsworth & Brooks / Cole mathematics series, Wadsworth 1986, ISBN 978-0-534-06324-5, pp. I-VIII, 1-359 - [j7]Yousef Alavi, Gary Chartrand, Ortrud R. Oellermann, Linda M. Lesniak:
Bipartite regulation numbers. Discret. Math. 62(2): 113-118 (1986) - [j6]Linda M. Lesniak, Ortrud R. Oellermann:
An Eulerian exposition. J. Graph Theory 10(3): 277-297 (1986)
1970 – 1979
- 1977
- [j5]Linda M. Lesniak-Foster:
A note on stable graphs. Discret. Math. 19(1): 93-97 (1977) - [j4]Linda M. Lesniak-Foster:
On n-Hamiltonian line graphs. J. Comb. Theory B 22(3): 263-273 (1977) - [j3]Linda M. Lesniak-Foster:
Some recent results in hamiltonian graphs. J. Graph Theory 1(1): 27-36 (1977) - [j2]Yousef Alavi, M. Behzad, Linda M. Lesniak-Foster, E. A. Nordhaus:
Total matchings and total coverings of graphs. J. Graph Theory 1(2): 135-140 (1977) - 1974
- [j1]Linda M. Lesniak:
Results on the edge-connectivity of graphs. Discret. Math. 8(4): 351-354 (1974)
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 2025-02-05 21:36 CET 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:
