ARTICLES :
[A29]
F. Havet, R. Kang, and J.-S. Sereni,
Improper colouring of unit disk graphs
Soumis
Abstract, postcript et pdf
[A28] J.-C. Bermond, F. Havet, F. Huc and C. Linhares-Sales,
Allocation de fréquences et coloration impropre des graphes
hexagonaux pondérés.
In 9emes rencontres francophones sur les Aspects
Algorithmiques des Telecommunications (ALGOTEL'2007)}, Ile d'Ol\'eron,
France, Mai 2007.
[A27] F. Havet, J. van Den Heuvel, C. McDiarmid and B. Reed,
List colouring squares of planar graphs.
Eurocomb'07, September 2007, Seville.
[A26] F. Havet, S. Thomassé and A. Yeo,
Hoang-Reed Conjecture for tournaments.
Accepté à Discrete
Mathematics
[A25] F. Havet and S. Thomassé,
Complexity of (p, 1)-total labelling.
Soumis à Discrete
Mathematics
[A24]
L. Addario-Berry, M. Chudnovsky, F. Havet, B. Reed, and P. Seymour,
Bisimplicial vertices in even-hole-free graphs.
Soumis à Journal of Combinatorial Theory Serie
B
Postcript
et pdf
[A23]
F. Havet, R. Kang, T. Muller, and J.-S. Sereni,
Circular choosability.
Soumis
à Journal of Graph Theory
Abstract, postcript et pdf
[A22]
F. Havet, J.-S. Sereni and R. Skrekovski,
3-facial colouring of plane graphs
Accepté
à SIAM J. of Discrete Math.
Abstract, postcript et pdf
[A21] O. Delmas,
F. Havet, M. Montassier and S. Pérennes,
Design of fault tolerant on-board networks
Soumis.
Abstract et version postcript
Soumis à Discrete Applied Math.
[A20] F. Havet,
Choosability of the square of planar graphs with large girth
Accepté àDiscrete
Mathematics.
Abstract et version postcript
[A19] L. Addario-Berry, F. Havet and S. Thomassé,
Paths with two blocks in n-chromatic digraphs.
Journal of Combinatorial Theory Serie
B, 97, 620-626, (2007).
Abstract
et version postcript
[A18] S. Bessy, E. Birmelé and F. Havet, Arc-chromatic number of digraphs in which each vertex has bounded outdegree or bounded indegree.
Journal of Graph Theory,
53 (4), 315-332 (2006).
Abstract et version postcript
[A17] F. Havet and J.-S. Sereni, Improper choosability of graphs and maximum average degree.
Journal of Graph Theory, 52 (3), 181-199 (2006).
Abstract et version postcript
[A16] F. Havet,
Stable set meeting every longest paths.
Discrete
Mathematics, 289 (1-3), 169-173 (2004).
Abstract
et version postcript
[A15] F. Havet and M. L. Yu, (p,1)total labelling
of graphs.
Discrete
Mathematics, 308, 496-513, 2008
[A14] F. Havet, Robustness of a
routing tree for the Push Tree Problem
Proceedings of Algotel'02, Meze, France, 2002, 81-86.
Version pdf
[A13] F. Havet, Repartitors, selectors and superselectors
Journal of Interconnection Networks, 7 (3), 391-415, 2006.
Abstract et version postcript
[A12] F. Havet,
Pancyclic arcs and connectivity in tournaments
Journal of Graph Theory, 47, 87-110 (2004).
Version pdf
[A11] J.C. Bermond, F. Havet and
D. Tóth, Fault tolerant on-board networks with priories.
Networks, 47, 9-25 (2006).
Abstract et version poscript.
[A10] F. Havet and M. Wennink,
The Push Tree Problem
Networks,44 (4), 281-291 (2004)
Extended abstract.
[A9] S. Céroi and F. Havet, Trees with three
leaves are (n+1)-unavoidable.
Discrete Applied Mathematics,
141, 19-39 (2004).
Extended abstract.
Version postscript.
[A8] F. Havet, On unavoidability of trees with k leaves.
Graphs
and Combinatorics, 19, 101-110 (2003).
Extended Abstract,
Version postscript.
[A7] F. Havet and S. Thomassé, Median orders: a
tool for the second neighborhood
problem and Sumner's conjecture.
Journal of Graph Theory,
35 (4), 244-256 (2000).
Version
postscript,
Version pdf.
[A6] F. Havet and J. Zerovnik, Finding a five bicolouring of a triangle-free subgraph of the triangular lattice.
Discrete
Mathematics, 244, 103-108 (2002).
Version postscript.
[A5] F. Havet, Channel assignment
and multicolouring of the
induced subgraphs of the triangular lattice,
Discrete
Mathematics 233 (1-3), 219-231 (2001).
Version
postscript.
[A4] F. Havet, Finding oriented Hamiltonian paths in
tournaments.
Journal of
Algorithms 36, 253-275 (2000).
Version postscript,
Version pdf.
[A3] F. Havet, Trees in tournaments,
Discrete
Mathematics 243(1-3), 121-134 (2002)
Version
postscript.
[A2] F. Havet, Hamiltonian cycles in tournaments.
Journal of Combinatorial Theory Serie
B 80 (1), 1-31 (2000).
Version postscript,
Version pdf.
[A1] F. Havet and S. Thomassé,
Oriented hamiltonian paths in tournaments: a proof of
Rosenfeld's conjecture.,
Journal of Combinatorial Theory Serie
B 78 (2), 243-273 (2000).
Version postscript, Version pdf.