Results on the edge-connectivity of graphs. - Linda M. Lesniak (Discret. Math., 1974)

A note on stable graphs. - Linda M. Lesniak-Foster (Discret. Math., 1977)

On n-Hamiltonian line graphs. - Linda M. Lesniak-Foster (J. Comb. Theory B, 1977)

Total matchings and total coverings of graphs. - Yousef Alavi; M. Behzad; Linda M. Lesniak-Foster; E. A. Nordhaus (J. Graph Theory, 1977)

Some recent results in hamiltonian graphs. - Linda M. Lesniak-Foster (J. Graph Theory, 1977)

Graphs and digraphs (2. ed.). - Gary Chartrand; Linda M. Lesniak (Wadsworth, 1986)

Bipartite regulation numbers. - Yousef Alavi; Gary Chartrand; Ortrud R. Oellermann; Linda M. Lesniak (Discret. Math., 1986)

An Eulerian exposition. - Linda M. Lesniak; Ortrud R. Oellermann (J. Graph Theory, 1986)

On a Neighborhood Condition Implying the Existence of Disjoint Complete Graphs. - Ralph J. Faudree; Michael S. Jacobson; Ronald J. Gould; Linda M. Lesniak (Eur. J. Comb., 1989)

On the edge-connectivity vector of a graph. - Linda M. Lesniak; Raymond E. Pippert (Networks, 1989)

Lower bounds for lower Ramsey numbers. - Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Linda M. Lesniak (J. Graph Theory, 1990)

Neighborhood conditions and edge-disjoint perfect matchings. - Ralph J. Faudree; Ronald J. Gould; Linda M. Lesniak (Discret. Math., 1991)

Generalized Degrees and Menger Path Systems. - Ralph J. Faudree; Ronald J. Gould; Linda M. Lesniak (Discret. Appl. Math., 1992)

Neighborhood unions and a generalization of Dirac's theorem. - Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Linda M. Lesniak (Discret. Math., 1992)

On independent generalized degrees and independence numbers in K(1, m)-free graphs. - Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Linda M. Lesniak; Terri Lindquester (Discret. Math., 1992)

Ø-Threshold and Ø-Tolerance Chain Graphs. - Michael S. Jacobson; Jenö Lehel; Linda M. Lesniak (Discret. Appl. Math., 1993)

Cycles of length 0 modulo 4 in graphs. - Nathaniel Dean; Linda M. Lesniak; Akira Saito (Discret. Math., 1993)

Rainbow coloring the cube. - Ralph J. Faudree; András Gyárfás; Linda M. Lesniak; Richard H. Schelp (J. Graph Theory, 1993)

On the rotation distance of graphs. - Ralph J. Faudree; Richard H. Schelp; Linda M. Lesniak; András Gyárfás; Jenö Lehel (Discret. Math., 1994)

Degree conditions and cycle extendability. - Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Linda M. Lesniak (Discret. Math., 1995)

Spanning caterpllars with bounded diameter. - Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Linda M. Lesniak (Discuss. Math. Graph Theory, 1995)

Hamiltonicity in balancedk-partite graphs. - Guantao Chen; Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Linda M. Lesniak (Graphs Comb., 1995)

Generalized degree conditions for graphs with bounded independence number. - Ralph J. Faudree; Ronald J. Gould; Linda M. Lesniak; Terri Lindquester (J. Graph Theory, 1995)

Graph spectra. - Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Jenö Lehel; Linda M. Lesniak (Discret. Math., 1996)

Degree conditions for 2-factors. - Stephan Brandt; Guantao Chen; Ralph J. Faudree; Ronald J. Gould; Linda M. Lesniak (J. Graph Theory, 1997)

Cycles in 2-Factors of Balanced Bipartite Graphs. - Guantao Chen; Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Linda M. Lesniak (Graphs Comb., 2000)

On k-ordered graphs. - Jill R. Faudree; Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Linda M. Lesniak (J. Graph Theory, 2000)

Characterizing forbidden clawless triples implying hamiltonian graphs. - Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Linda M. Lesniak (Discret. Math., 2002)

Degree conditions for k-ordered hamiltonian graphs. - Ralph J. Faudree; Ronald J. Gould; Alexandr V. Kostochka; Linda M. Lesniak; Ingo Schiermeyer; Akira Saito (J. Graph Theory, 2003)

Toughness, degrees and 2-factors. - Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Linda M. Lesniak; Akira Saito (Discret. Math., 2004)

Linear forests and ordered cycles. - Guantao Chen; Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Linda M. Lesniak; Florian Pfender (Discuss. Math. Graph Theory, 2004)

Generalizing Pancyclic and k-Ordered Graphs. - Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Linda M. Lesniak (Graphs Comb., 2004)

A note on 2-factors with two components. - Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Linda M. Lesniak; Akira Saito (Discret. Math., 2005)

Minimal Degree and (k, m)-Pancyclic Ordered Graphs. - Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Linda M. Lesniak (Graphs Comb., 2005)

Recognizable colorings of graphs. - Gary Chartrand; Linda M. Lesniak; Donald W. VanderJagt; Ping Zhang 004 (Discuss. Math. Graph Theory, 2008)

Matching preclusion for Alternating Group Graphs and their Generalizations. - Eddie Cheng 001; Linda M. Lesniak; Marc J. Lipman; László Lipták (Int. J. Found. Comput. Sci., 2008)

On the circumference of a graph and its complement. - Ralph J. Faudree; Linda M. Lesniak; Ingo Schiermeyer (Discret. Math., 2009)

Conditional matching preclusion sets. - Eddie Cheng 001; Linda M. Lesniak; Marc J. Lipman; László Lipták (Inf. Sci., 2009)

Revisit of Erdős-Gallai's theorem on the circumference of a graph. - Shinya Fujita 001; Linda M. Lesniak (Inf. Process. Lett., 2013)

The vertex size-Ramsey number. - Andrzej Dudek; Linda M. Lesniak (Discret. Math., 2016)

Chorded Pancyclicity in k-Partite Graphs. - Daniela Ferrero; Linda M. Lesniak (Graphs Comb., 2018)

On the necessity of Chvátal's Hamiltonian degree condition. - Douglas Bauer; Linda M. Lesniak; Aori Nevo; Edward F. Schmeichel (AKCE Int. J. Graphs Comb., 2020)

A generalization of a theorem of Nash-Williams. - Douglas Bauer; Linda M. Lesniak; Edward F. Schmeichel (Graphs Comb., 2022)

Extending Poto?nik and ?ajna's conditions on the existence of vertex-transitive self-complementary k-hypergraphs. - Linda M. Lesniak; Henri Thuiller; Adam Pawel Wojda (Discuss. Math. Graph Theory, 2023)

On the Existence of (r,g,χ )-Cages. - Gabriela Araujo-Pardo; Zhanar Berikkyzy; Linda M. Lesniak (Graphs Comb., 2025)