Evelyne Flandrin

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
A note on neighbor expanded sum distinguishing index.
Discuss. Math. Graph Theory, 2017

2013
Neighbor Sum Distinguishing Index.
Graphs Comb., 2013

2011
A Note on Degree Conditions for Traceability in Locally Claw-Free Graphs.
Math. Comput. Sci., 2011

2010
Cyclability in k-connected K<sub>1, 4</sub>-free graphs.
Discret. Math., 2010

2009
On Extremal Graphs with Bounded Girth.
Electron. Notes Discret. Math., 2009

A sufficient condition for pancyclability of graphs.
Discret. Math., 2009

Hamiltonicity and pancyclicity of cartesian products of graphs.
Discret. Math., 2009

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

2008
Neighborhood unions and extremal spanning trees.
Discret. Math., 2008

2007
A sufficient condition for cyclability in directed graphs.
Discret. Math., 2007

A Chvátal-Erdos type condition for pancyclability.
Discret. Math., 2007

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

Bipartite graphs with every matching in a cycle.
Discret. Math., 2007

2006
Hamiltonicity and pancyclicity of generalized prisms.
Electron. Notes Discret. Math., 2006

Chvátal-Erdös condition and pancyclism.
Discuss. Math. Graph Theory, 2006

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

Hamiltonian cycles and paths through matchings.
Electron. Notes Discret. Math., 2005

2004
A note on pancyclism of highly connected graphs.
Discret. Math., 2004

Cycles through given vertices and closures.
Discret. Math., 2004

New sufficient conditions for bipancyclic bipartite graphs.
Discret. Math., 2004

2001
A note on a new condition implying pancyclism.
Discuss. Math. Graph Theory, 2001

Clique covering and degree conditions for hamiltonicity in claw-free graphs.
Discret. Math., 2001

On quasifactorability in graphs.
Discret. Math., 2001

Cyclability and pancyclability in bipartite graphs.
Discret. Math., 2001

2000
Even Cycles in Graphs with Many Odd Cycles.
Graphs Comb., 2000

1999
Some properties of 3-domination-critical graphs.
Discret. Math., 1999

An Ore-type condition for pancyclability.
Discret. Math., 1999

On 2-factors in claw-free graphs.
Discret. Math., 1999

Induced S(K<sub>1, 3</sub>) and hamiltonian cycles in the square of a graph.
Discret. Math., 1999

1997
Claw-free graphs - A survey.
Discret. Math., 1997

Dlambda-cycles in lambda-claw-free graphs.
Discret. Math., 1997

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

Pancyclism and small cycles in graphs.
Discuss. Math. Graph Theory, 1996

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

1995
Dominating cycles in bipartite biclaw-free graphs.
Discret. Math., 1995

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

Hamiltonicity of Bipartite Biclaw-free Graphs.
Discret. Appl. Math., 1994

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

On hamiltonian claw-free graphs.
Discret. Math., 1993

1991
Hamiltonism, degree sum and neighborhood intersections.
Discret. Math., 1991

Pancyclism in hamiltonian graphs.
Discret. Math., 1991

1983
Hamiltonian pancyclic graphs.
Discret. Math., 1983


  Loading...