Linda M. Lesniak

Orcid: 0000-0001-7409-6437

Affiliations:
  • Drew University, Madison, USA
  • Western Michigan University, Kalamazoo, USA


According to our database1, Linda M. Lesniak authored at least 44 papers between 1974 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Extending Poto?nik and ?ajna's conditions on the existence of vertex-transitive self-complementary k-hypergraphs.
Discuss. Math. Graph Theory, 2023

2022
A generalization of a theorem of Nash-Williams.
Graphs Comb., 2022

2020
On the necessity of Chvátal's Hamiltonian degree condition.
AKCE Int. J. Graphs Comb., 2020

2018
Chorded Pancyclicity in <i>k</i>-Partite Graphs.
Graphs Comb., 2018

2016
The vertex size-Ramsey number.
Discret. Math., 2016

2013
Revisit of Erdős-Gallai's theorem on the circumference of a graph.
Inf. Process. Lett., 2013

2009
Conditional matching preclusion sets.
Inf. Sci., 2009

On the circumference of a graph and its complement.
Discret. Math., 2009

2008
Matching preclusion for Alternating Group Graphs and their Generalizations.
Int. J. Found. Comput. Sci., 2008

Recognizable colorings of graphs.
Discuss. Math. Graph Theory, 2008

2005
Minimal Degree and (<i>k, m</i>)-Pancyclic Ordered Graphs.
Graphs Comb., 2005

A note on 2-factors with two components.
Discret. Math., 2005

2004
Generalizing Pancyclic and <i>k</i>-Ordered Graphs.
Graphs Comb., 2004

Linear forests and ordered cycles.
Discuss. Math. Graph Theory, 2004

Toughness, degrees and 2-factors.
Discret. Math., 2004

2003
Degree conditions for <i>k</i>-ordered hamiltonian graphs.
J. Graph Theory, 2003

2002
Characterizing forbidden clawless triples implying hamiltonian graphs.
Discret. Math., 2002

2000
On <i>k</i>-ordered graphs.
J. Graph Theory, 2000

Cycles in 2-Factors of Balanced Bipartite Graphs.
Graphs Comb., 2000

1997
Degree conditions for 2-factors.
J. Graph Theory, 1997

1996
Graph spectra.
Discret. Math., 1996

1995
Generalized degree conditions for graphs with bounded independence number.
J. Graph Theory, 1995

Hamiltonicity in balanced<i>k</i>-partite graphs.
Graphs Comb., 1995

Spanning caterpllars with bounded diameter.
Discuss. Math. Graph Theory, 1995

Degree conditions and cycle extendability.
Discret. Math., 1995

1994
On the rotation distance of graphs.
Discret. Math., 1994

1993
Rainbow coloring the cube.
J. Graph Theory, 1993

Cycles of length 0 modulo 4 in graphs.
Discret. Math., 1993

Ø-Threshold and Ø-Tolerance Chain Graphs.
Discret. Appl. Math., 1993

1992
On independent generalized degrees and independence numbers in K(1, m)-free graphs.
Discret. Math., 1992

Neighborhood unions and a generalization of Dirac's theorem.
Discret. Math., 1992

Generalized Degrees and Menger Path Systems.
Discret. Appl. Math., 1992

1991
Neighborhood conditions and edge-disjoint perfect matchings.
Discret. Math., 1991

1990
Lower bounds for lower Ramsey numbers.
J. Graph Theory, 1990

1989
On the edge-connectivity vector of a graph.
Networks, 1989

On a Neighborhood Condition Implying the Existence of Disjoint Complete Graphs.
Eur. J. Comb., 1989

1986
An Eulerian exposition.
J. Graph Theory, 1986

Bipartite regulation numbers.
Discret. Math., 1986

Graphs and digraphs (2. ed.).
Wadsworth & Brooks / Cole mathematics series, Wadsworth, ISBN: 978-0-534-06324-5, 1986

1977
Some recent results in hamiltonian graphs.
J. Graph Theory, 1977

Total matchings and total coverings of graphs.
J. Graph Theory, 1977

On n-Hamiltonian line graphs.
J. Comb. Theory, Ser. B, 1977

A note on stable graphs.
Discret. Math., 1977

1974
Results on the edge-connectivity of graphs.
Discret. Math., 1974


  Loading...