Pierre Fraisse

According to our database, Pierre Fraisse authored at least 11 papers between 1985 and 2001.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2001

Hamiltonicity and Minimum Degree in 3-connected Claw-Free Graphs.

Odile Favaron, Pierre Fraisse

J. Comb. Theory B, 2001

1995

Equicovering matroids by distinct bases.

Pierre Fraisse, Pavol Hell

Eur. J. Comb., 1995

1989

A degree condition for the circumference of a graph.

Nathaniel Dean, Pierre Fraisse

J. Graph Theory, 1989

1988

A Chvátal-Erdös condition for (t, t)-factors in digraphs using given arcs.

Pierre Fraisse, Oscar Ordaz

Discret. Math., 1988

A note on distance-dominating cycles.

Pierre Fraisse

Discret. Math., 1988

1987

Hamiltonian dicycles avoiding prescribed arcs in tournaments.

Pierre Fraisse, Carsten Thomassen

Graphs Comb., 1987

1986

An efficient parallel algorithm for the transitive closure of a graph.

Pierre Fraisse

J. Syst. Softw., 1986

A new sufficient condition for hamiltonian graphs.

Pierre Fraisse

J. Graph Theory, 1986

A note on<i>f</i>-factors in directed and undirected multigraphs.

Pierre Fraisse, Pavol Hell, David G. Kirkpatrick

Graphs Comb., 1986

1985

Cycle covering in bridgeless graphs.

Pierre Fraisse

J. Comb. Theory B, 1985

On a conjecture of bondy.

Irène Fournier, Pierre Fraisse

J. Comb. Theory B, 1985