| 2008 |
|---|
| 30 | EE | Frédéric Havet,
Bruce A. Reed,
Jean-Sébastien Sereni:
L(2, 1)-labelling of graphs.
SODA 2008: 621-630 |
| 29 | EE | Frédéric Havet,
Stéphan Thomassé,
Anders Yeo:
Hoàng-Reed conjecture holds for tournaments.
Discrete Mathematics 308(15): 3412-3415 (2008) |
| 28 | EE | Frédéric Havet,
Min-Li Yu:
(p, 1)-Total labelling of graphs.
Discrete Mathematics 308(4): 496-513 (2008) |
| 27 | EE | Louigi Addario-Berry,
Maria Chudnovsky,
Frédéric Havet,
Bruce A. Reed,
Paul D. Seymour:
Bisimplicial vertices in even-hole-free graphs.
J. Comb. Theory, Ser. B 98(6): 1119-1164 (2008) |
| 26 | EE | Frédéric Havet,
Jean-Sébastien Sereni,
Riste Skrekovski:
3-Facial Coloring of Plane Graphs.
SIAM J. Discrete Math. 22(1): 231-247 (2008) |
| 2007 |
|---|
| 25 | EE | Omid Amini,
Frédéric Havet,
Florian Huc,
Stéphan Thomassé:
WDM and Directed Star Arboricity
CoRR abs/0705.0315: (2007) |
| 24 | EE | Frédéric Havet,
Jan van den Heuvel,
Colin McDiarmid,
Bruce A. Reed:
List Colouring Squares of Planar Graphs.
Electronic Notes in Discrete Mathematics 29: 515-519 (2007) |
| 23 | EE | Louigi Addario-Berry,
Frédéric Havet,
Stéphan Thomassé:
Paths with two blocks in n-chromatic digraphs.
J. Comb. Theory, Ser. B 97(4): 620-626 (2007) |
| 2006 |
|---|
| 22 | EE | Frédéric Havet,
Jean-Sébastien Sereni,
Riste Skrekovski:
3-facial colouring of plane graphs
CoRR abs/cs/0607008: (2006) |
| 21 | EE | Frédéric Havet,
Jean-Sébastien Sereni:
Improper choosability of graphs and maximum average degree.
Journal of Graph Theory 52(3): 181-199 (2006) |
| 20 | EE | Stéphane Bessy,
Frédéric Havet,
Etienne Birmelé:
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree.
Journal of Graph Theory 53(4): 315-332 (2006) |
| 19 | EE | Frédéric Havet:
Repartitors, Selectors and Superselectors.
Journal of Interconnection Networks 7(3): 391-415 (2006) |
| 18 | EE | Jean-Claude Bermond,
Frédéric Havet,
Csaba D. Tóth:
Fault tolerant on-board networks with priorities.
Networks 47(1): 9-25 (2006) |
| 2005 |
|---|
| 17 | EE | Frédéric Havet,
Jean-Sébastien Sereni:
Channel Assignment and Improper Choosability of Graphs.
WG 2005: 81-90 |
| 16 | EE | Frédéric Havet,
Ross J. Kang,
Jean-Sébastien Sereni:
Improper Colourings of Unit Disk Graphs.
Electronic Notes in Discrete Mathematics 22: 123-128 (2005) |
| 2004 |
|---|
| 15 | EE | Stéphan Ceroi,
Frédéric Havet:
Trees with three leaves are (n+1)-unavoidable.
Discrete Applied Mathematics 141(1-3): 19-39 (2004) |
| 14 | EE | Frédéric Havet:
Stable set meeting every longest path.
Discrete Mathematics 289(1-3): 169-173 (2004) |
| 13 | EE | Frédéric Havet:
Pancyclic arcs and connectivity in tournaments.
Journal of Graph Theory 47(2): 87-110 (2004) |
| 12 | EE | Frédéric Havet,
Marc Wennink:
The Push Tree problem.
Networks 44(4): 281-291 (2004) |
| 2003 |
|---|
| 11 | EE | Frédéric Havet:
On Unavoidability of Trees with kLeaves.
Graphs and Combinatorics 19(1): 101-110 (2003) |
| 2002 |
|---|
| 10 | | Frédéric Havet:
Design of Fault Tolerant Satellite Networks with Priorities via Selectors.
SIROCCO 2002: 165-179 |
| 9 | EE | Frédéric Havet:
Trees in tournaments.
Discrete Mathematics 243(1-3): 121-134 (2002) |
| 8 | EE | Frédéric Havet,
Janez Zerovnik:
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice.
Discrete Mathematics 244(1-3): 103-108 (2002) |
| 2001 |
|---|
| 7 | EE | Frédéric Havet,
Marc Wennink:
The push tree problem.
SPAA 2001: 318-319 |
| 6 | EE | Frédéric Havet:
Channel assignment and multicolouring of the induced subgraphs of the triangular lattice.
Discrete Mathematics 233(1-3): 219-231 (2001) |
| 5 | EE | Stéphan Ceroi,
Frédéric Havet:
Trees with three leaves are (n + l)-unavoidable.
Electronic Notes in Discrete Mathematics 7: 202-205 (2001) |
| 2000 |
|---|
| 4 | EE | Frédéric Havet:
Trees in tournaments.
Electronic Notes in Discrete Mathematics 5: 166-169 (2000) |
| 3 | | Frédéric Havet:
Finding an Oriented Hamiltonian Path in a Tournament.
J. Algorithms 36(2): 253-275 (2000) |
| 2 | EE | Frédéric Havet,
Stéphan Thomassé:
Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture.
J. Comb. Theory, Ser. B 78(2): 243-273 (2000) |
| 1 | EE | Frédéric Havet:
Oriented Hamiltonian Cycles in Tournaments.
J. Comb. Theory, Ser. B 80(1): 1-31 (2000) |
