Linda M. Lesniak

According to our database1, Linda M. Lesniak authored at least 38 papers between 1977 and 2013.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

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.
Discrete Mathematics, 2009

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

Recognizable colorings of graphs.
Discussiones Mathematicae Graph Theory, 2008

2005
Minimal Degree and (k, m)-Pancyclic Ordered Graphs.
Graphs and Combinatorics, 2005

A note on 2-factors with two components.
Discrete Mathematics, 2005

2004
Generalizing Pancyclic and k-Ordered Graphs.
Graphs and Combinatorics, 2004

Linear forests and ordered cycles.
Discussiones Mathematicae Graph Theory, 2004

Toughness, degrees and 2-factors.
Discrete Mathematics, 2004

2003
Degree conditions for k-ordered hamiltonian graphs.
Journal of Graph Theory, 2003

2002
Characterizing forbidden clawless triples implying hamiltonian graphs.
Discrete Mathematics, 2002

2000
On k-ordered graphs.
Journal of Graph Theory, 2000

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

1997
Degree conditions for 2-factors.
Journal of Graph Theory, 1997

1996
Graph spectra.
Discrete Mathematics, 1996

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

Hamiltonicity in balancedk-partite graphs.
Graphs and Combinatorics, 1995

Spanning caterpllars with bounded diameter.
Discussiones Mathematicae Graph Theory, 1995

Degree conditions and cycle extendability.
Discrete Mathematics, 1995

1994
On the rotation distance of graphs.
Discrete Mathematics, 1994

1993
Rainbow coloring the cube.
Journal of Graph Theory, 1993

Cycles of length 0 modulo 4 in graphs.
Discrete Mathematics, 1993

Ø-Threshold and Ø-Tolerance Chain Graphs.
Discrete Applied Mathematics, 1993

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

Neighborhood unions and a generalization of Dirac's theorem.
Discrete Mathematics, 1992

Generalized Degrees and Menger Path Systems.
Discrete Applied Mathematics, 1992

1991
Neighborhood conditions and edge-disjoint perfect matchings.
Discrete Mathematics, 1991

1990
Lower bounds for lower Ramsey numbers.
Journal of 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.
Journal of Graph Theory, 1986

Bipartite regulation numbers.
Discrete Mathematics, 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.
Journal of Graph Theory, 1977

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

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

A note on stable graphs.
Discrete Mathematics, 1977


  Loading...