Evelyne Flandrin

According to our database1, Evelyne Flandrin authored at least 42 papers between 1983 and 2017.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
A note on neighbor expanded sum distinguishing index.
Discussiones Mathematicae Graph Theory, 2017

2013
Neighbor Sum Distinguishing Index.
Graphs and Combinatorics, 2013

2011
A Note on Degree Conditions for Traceability in Locally Claw-Free Graphs.
Mathematics in Computer Science, 2011

2010
Cyclability in k-connected K1, 4-free graphs.
Discrete Mathematics, 2010

2009
On Extremal Graphs with Bounded Girth.
Electronic Notes in Discrete Mathematics, 2009

A sufficient condition for pancyclability of graphs.
Discrete Mathematics, 2009

Hamiltonicity and pancyclicity of cartesian products of graphs.
Discrete Mathematics, 2009

A degree condition implying that every matching is contained in a hamiltonian cycle.
Discrete Mathematics, 2009

2008
Neighborhood unions and extremal spanning trees.
Discrete Mathematics, 2008

2007
A sufficient condition for cyclability in directed graphs.
Discrete Mathematics, 2007

A Chvátal-Erdos type condition for pancyclability.
Discrete Mathematics, 2007

A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs.
Discrete Mathematics, 2007

Bipartite graphs with every matching in a cycle.
Discrete Mathematics, 2007

2006
Hamiltonicity and pancyclicity of generalized prisms.
Electronic Notes in Discrete Mathematics, 2006

Chvátal-Erdös condition and pancyclism.
Discussiones Mathematicae Graph Theory, 2006

2005
A Note on a Generalisation of Ore's Condition.
Graphs and Combinatorics, 2005

Hamiltonian cycles and paths through matchings.
Electronic Notes in Discrete Mathematics, 2005

2004
A note on pancyclism of highly connected graphs.
Discrete Mathematics, 2004

Cycles through given vertices and closures.
Discrete Mathematics, 2004

New sufficient conditions for bipancyclic bipartite graphs.
Discrete Mathematics, 2004

2001
A note on a new condition implying pancyclism.
Discussiones Mathematicae Graph Theory, 2001

Clique covering and degree conditions for hamiltonicity in claw-free graphs.
Discrete Mathematics, 2001

On quasifactorability in graphs.
Discrete Mathematics, 2001

Cyclability and pancyclability in bipartite graphs.
Discrete Mathematics, 2001

2000
Even Cycles in Graphs with Many Odd Cycles.
Graphs and Combinatorics, 2000

1999
Some properties of 3-domination-critical graphs.
Discrete Mathematics, 1999

An Ore-type condition for pancyclability.
Discrete Mathematics, 1999

On 2-factors in claw-free graphs.
Discrete Mathematics, 1999

Induced S(K1, 3) and hamiltonian cycles in the square of a graph.
Discrete Mathematics, 1999

1997
Claw-free graphs - A survey.
Discrete Mathematics, 1997

Dlambda-cycles in lambda-claw-free graphs.
Discrete Mathematics, 1997

1996
Sequences, claws and cyclability of graphs.
Journal of Graph Theory, 1996

Pancyclism and small cycles in graphs.
Discussiones Mathematicae Graph Theory, 1996

Shortest walks in almost claw-free graphs.
Ars Comb., 1996

1995
Dominating cycles in bipartite biclaw-free graphs.
Discrete Mathematics, 1995

1994
Mengerian properties, hamiltonicity, and claw-free graphs.
Networks, 1994

Hamiltonicity of Bipartite Biclaw-free Graphs.
Discrete Applied Mathematics, 1994

1993
The complete closure of a graph.
Journal of Graph Theory, 1993

On hamiltonian claw-free graphs.
Discrete Mathematics, 1993

1991
Hamiltonism, degree sum and neighborhood intersections.
Discrete Mathematics, 1991

Pancyclism in hamiltonian graphs.
Discrete Mathematics, 1991

1983
Hamiltonian pancyclic graphs.
Discrete Mathematics, 1983


  Loading...