Pierre Fraisse

11 papers Journal 11
YearRankTypeTitle / Venue / Authors
2001 J jnl
Hamiltonicity and Minimum Degree in 3-connected Claw-Free Graphs.
J. Comb. Theory B
Odile Favaron, Pierre Fraisse
1995 J jnl
Equicovering matroids by distinct bases.
Eur. J. Comb.
Pierre Fraisse, Pavol Hell
1989 J jnl
A degree condition for the circumference of a graph.
J. Graph Theory
Nathaniel Dean, Pierre Fraisse
1988 J jnl
A Chvátal-Erdös condition for (t, t)-factors in digraphs using given arcs.
Discret. Math.
Pierre Fraisse, Oscar Ordaz
1988 J jnl
A note on distance-dominating cycles.
Discret. Math.
Pierre Fraisse
1987 J jnl
Hamiltonian dicycles avoiding prescribed arcs in tournaments.
Graphs Comb.
Pierre Fraisse, Carsten Thomassen
1986 J jnl
A new sufficient condition for hamiltonian graphs.
J. Graph Theory
Pierre Fraisse
1986 J jnl
A note on
Graphs Comb.
Pierre Fraisse, Pavol Hell, David G. Kirkpatrick
1986 J jnl
An efficient parallel algorithm for the transitive closure of a graph.
J. Syst. Softw.
Pierre Fraisse
1985 J jnl
Cycle covering in bridgeless graphs.
J. Comb. Theory B
Pierre Fraisse
1985 J jnl
On a conjecture of bondy.
J. Comb. Theory B
Irène Fournier, Pierre Fraisse