Publications of F. Havet

1. F. Havet. Graph colouring and applications. Habilitation à Diriger des Recherches, Université de Nice-Sophia Antipolis, December 12 2007. [WWW ] [bibtex-entry]

1. L. Addario-Berry, F. Havet, C. Linhares Sales, B. Reed, and S. Thomassé. Oriented trees in digraphs. Discrete Mathematics, 313(8):967-974, 2013. [WWW ] [PDF ] [Abstract] [bibtex-entry]


2. S. Guillemot, F. Havet, C. Paul, and A. Perez. On the (non-)existence of polynomial kernels for $P_l$-free edge modification problems. Algorithmica, 65(4):900-926, 2013. [PDF ] [Abstract] [bibtex-entry]


3. J. Araujo, J-C. Bermond, F. Giroire, F. Havet, D. Mazauric, and R. Modrzejewski. Weighted improper colouring. Journal of Discrete Algorithms, 16:53-66, 2012.
   Note: Selected papers from the 22nd International Workshop on Combinatorial Algorithms (IWOCA 2011). [WWW ] [PDF ] [Abstract] [bibtex-entry]


4. J. Araujo, N. Cohen, F. Giroire, and F. Havet. Good edge-labelling of graphs. Discrete Applied Mathematics, 160(18):2501-2513, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]


5. J. Bang-Jensen, F. Havet, and N. Trotignon. Finding an induced subdivision of a digraph. Theoretical Computer Science, 443:10-24, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]


6. V. Campos, A. Gyárfás, F. Havet, C. Linhares Sales, and F. Maffray. New bounds on the Grundy number of products of graphs. Journal of Graph Theory, 71(1):78-88, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]


7. D. Gonçalves, F. Havet, A. Pinlou, and S. Thomassé. On spanning galaxies in digraphs. Discrete Applied Mathematics, 160(6):744-754, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]


8. F. Havet, C. Linhares Sales, and L. Sampaio. b-coloring of tight graphs. Discrete Applied Mathematics, 160(18):2709-2715, 2012. [WWW ] [bibtex-entry]


9. F. Havet, B. Reed, and J.-S. Sereni. Griggs and Yeh's conjecture and $L(p,1)$-labellings. SIAM Journal on Discrete Mathematics, 26(1):145-168, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]


10. M. Basavaraju, L. S. Chandran, N. Cohen, F. Havet, and T. Müller. Acyclic edge-coloring of planar graphs. SIAM Journal of Discrete Mathematics, 25(2):463--478, 2011. [PDF ] [Abstract] [bibtex-entry]


11. N. Cohen and F. Havet. Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree. Graphs and Combinatorics, 27(6):831-849, 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]


12. R. Erman, F. Havet, B. Lidicky, and O. Pangrác. 5-colouring graphs with 4 crossings. SIAM Journal on Discrete Mathematics, 25(1):401-422, 2011. [PDF ] [Abstract] [bibtex-entry]


13. F. Havet, S. Jendrol', R. Soták, and E. Skrabul'áková. Facial non-repetitive edge-colouring of plane graphs. Journal of Graph Theory, 66(1):38--48, 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]


14. F. Havet, M. Klazar, J. Kratochvìl, D. Kratsch, and M. Liedloff. Exact algorithms for L(2,1)-labelling. Algorithmica, 59(2):169--194, 2011. [PDF ] [Abstract] [bibtex-entry]


15. O. Amini, F. Havet, F. Huc, and S. Thomassé. WDM and directed star arboricity. Combinatorics, Probability and Computing, 19:161--182, 2010. [PDF ] [Abstract] [bibtex-entry]


16. M. Asté, F. Havet, and C. Linhares Sales. Grundy number and products of graphs. Discrete Mathematics, 310(9):1482--1490, 2010. [PDF ] [Abstract] [bibtex-entry]


17. J-C. Bermond, F. Havet, F. Huc, and C. Linhares Sales. Improper colouring of weighted grid and hexagonal graphs. Discrete Mathematics, Algorithms and Applications, 2(3):395-411, 2010. [PDF ] [Abstract] [bibtex-entry]


18. N. Cohen and F. Havet. Planar graphs with maximum degree $\Delta\geq 9$ are ($\Delta+1$)-edge-choosable -- short proof. Discrete Mathematics, 310(21):3049--3051, 2010. [PDF ]
    Keywords: edge-colouring, list colouring, List Colouring Conjecture, planar graphs. [Abstract] [bibtex-entry]


19. N. Eggemann, F. Havet, and S. Noble. k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. Discrete Applied Mathematics, 158(16):1777--1788, 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]


20. F. Havet, D. Král, J.-S. Sereni, and R. Skrekovski. Facial coloring using Hall's theorems. European Journal of Combinatorics, 31:1001--1019, 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]


21. R. Correa, F. Havet, and J-S. Sereni. About a Brooks-type theorem for improper colouring. Australasian Journal of Combinatorics, 43:219--230, 2009. [PDF ] [Abstract] [bibtex-entry]


22. F. Havet. Choosability of the square of planar subcubic graphs with large girth. Discrete Mathematics, 309:3553--3563, 2009. [PDF ] [Abstract] [bibtex-entry]


23. F. Havet, R. Kang, T. Müller, and J.-S. Sereni. Circular choosability. Journal of Graph Theory, 61(4):241--334, 2009. [PDF ] [Abstract] [bibtex-entry]


24. F. Havet, R. Kang, and J.-S. Sereni. Improper Colouring of Unit Disk Graphs. Networks, 54(3):150--164, 2009. [Abstract] [bibtex-entry]


25. F. Havet and S. Thomassé. Complexity of $(p,1)$-total labelling. Dicrete Applied Mathematics, 157:2859--2870, 2009. [PDF ] [Abstract] [bibtex-entry]


26. L. Addario-Berry, M. Chudnovsky, F. Havet, B. Reed, and P. Seymour. Bisimplicial vertices in even-hole-free graphs. Journal of Combinatorial Theory Ser. B, 98(6):1119--1164, 2008. [PDF ] [Abstract] [bibtex-entry]


27. F. Havet, J.-S. Sereni, and R. Skrekovski. 3-facial colouring of plane graphs. SIAM Journal on Discrete Mathematics, 22(1):231--247, 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]


28. F. Havet, S. Thomassé, and A. Yeo. Hoang-Reed conjecture for tournaments. Discrete Mathematics, 308(15):3412--3415, August 2008. [PDF ] [Abstract] [bibtex-entry]


29. F. Havet and M.-L. Yu. $(p,1)$-total labelling of graphs. Discrete Mathematics, 308(4):496--513, February 2008. [PDF ] [Abstract] [bibtex-entry]


30. L. Addario-Berry, F. Havet, and S. Thomassé. Paths with two blocks in $n$-chromatic digraphs. Journal of Combinatorial Theory Ser. B, 97:620--626, 2007. [PDF ] [bibtex-entry]


31. J-C. Bermond, F. Havet, and D. Tóth. Fault tolerant on board networks with priorities. Networks, 47(1):9--25, 2006. [PDF ] [Abstract] [bibtex-entry]


32. 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. [WWW ] [PDF ] [bibtex-entry]


33. F. Havet. Repartitors, selectors and superselectors. Journal of Interconnection Networks, 7(3):391--415, 2006. [PDF ] [bibtex-entry]


34. F. Havet and J.-S. Sereni. Improper choosability of graphs and maximum average degree. Journal of Graph Theory, 52(3):181--199, 2006. [PDF ] [bibtex-entry]


35. S. Céroi and F. Havet. Trees with three leaves are $(n+1)$-unavoidable. Discrete Applied Mathematics, 141:19--39, 2004. [PDF ] [bibtex-entry]


36. F. Havet. Pancyclic arcs and connectivity in tournaments. Journal of Graph Theory, 47(2):87--110, 2004. [PDF ] [bibtex-entry]


37. F. Havet. Stable set meeting every longest path. Discrete Mathematics, 289(1--3):169--173, 2004. [PDF ] [bibtex-entry]


38. F. Havet and M. Wennink. The Push Tree Problem. Networks, 44(4):281--291, 2004. [PDF ] [bibtex-entry]


39. F. Havet. On unavoidability of trees with $k$ leaves. Graphs and Combinatorics, 19:101--110, 2003. [PDF ] [bibtex-entry]


40. F. Havet. Trees in Tournament. Discrete Mathematics, 243(1--3):121--134, 2002. [PDF ] [bibtex-entry]


41. F. Havet and J. Zerovnik. Finding a Five Bicolouring of a Triangle-Free Subgraph of the Triangular Lattice. Discrete Mathematics, 244:103--108, 2002. [bibtex-entry]


42. F. Havet. Channel assignement and multicolouring of the induced subgraphs of the triangular lattice. Discrete Mathematics, 233:219--231, 2001. [bibtex-entry]


43. S. Bessy and F. Havet. Enumerating the edge-colourings and total colourings of a regular graph. Journal of Combinatorial Optimization, .
    Note: To appear. [PDF ] [Abstract] [bibtex-entry]


44. F. Havet and L. Sampaio. On the Grundy and $b$-chromatic Numbers of a Graph. Algorithmica, pp 1-15, .
    Note: To appear. [bibtex-entry]


45. F. Havet and X. Zhu. The game Grundy number of graphs. Journal of Combinatorial Optimization, .
    Note: To appear. [WWW ] [PDF ]
    Keywords: colouring game, game Grundy number, trees, partial 2-trees. [Abstract] [bibtex-entry]

1. J. Araujo, J-C. Bermond, F. Giroire, F. Havet, D. Mazauric, and R. Modrzejewski. Weighted Improper Colouring. In C. S. Iliopoulos and W. F. Smyth, editors, Combinatorial Algorithms, volume 7056 of Lecture Notes in Computer Science, Victoria, Canada, pages 1-18, June 2011. Springer Berlin Heidelberg. [WWW ] [PDF ] [Abstract] [bibtex-entry]


2. J. Bang-Jensen, F. Havet, and N. Trotignon. Finding an induced subdivision of a digraph. In VI Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2011), volume 37, Bariloche, Argentina, pages 09-14, 04 2011. [Abstract] [bibtex-entry]


3. F. Havet and L. Sampaio. On the Grundy number of a graph. In Proceedings of the International Symposium on Parameterized and Exact Computation(IPEC), number 6478 of Lecture Notes on Computer science, pages 170-179, December 2010. [PDF ] [Abstract] [bibtex-entry]


4. J. Araujo, N. Cohen, F. Giroire, and F. Havet. Good edge-labelling of graphs. In proceedings of the Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS'09), volume 35 of Electronic Notes in Discrete Mathematics, Gramado, Brazil, pages 275--280, December 2009. Springer. [PDF ] [Abstract] [bibtex-entry]


5. N. Cohen, F. Havet, and T. Müller. Acyclic edge-colouring of planar graphs. In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009), volume 34 of Electronic Notes on Discrete Mathematics, Bordeaux, France, pages 417-421, September 2009. [PDF ] [Abstract] [bibtex-entry]


6. D. Gonçalves, F. Havet, A. Pinlou, and S. Thomassé. Spanning galaxies in digraphs. In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009), volume 34 of Electronic Notes on Discrete Mathematics, Bordeaux, France, pages 139--143, September 2009. [PDF ] [Abstract] [bibtex-entry]


7. F. Havet and C. Linhares Sales. Combinatória e Problemas em Redes de Telecomunicações. In Colloque d'Informatique: Brésil / INRIA, Coopérations, Avancées et Défis, Bento Gonçalves, Brazil, pages 4p, July 2009. [PDF ] [Abstract] [bibtex-entry]


8. M. Asté, F. Havet, and C. Linhares-Sales. Grundy number and lexicographic product of graphs. In Proceedings of International Conference on Relations, Orders and Graphs and their Interaction with Computer Science (ROGICS 2008), pages 9p, May 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]


9. F. Havet, B. Reed, and J.-S. Sereni. L(2,1)-labelling of graphs. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithm (SODA 2008), pages 621-630, January 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]


10. 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 Neuvièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'07), Ile d'Oléron, France, pages 53-56, May 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]


11. F. Havet, J. van den Heuvel, C. McDiarmid, and B. Reed. List colouring squares of planar graphs. In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2007), volume 29 of Electronic Notes in Discrete Mathematics, Sevilla, Spain, pages 515-519, September 2007. [PDF ] [bibtex-entry]


12. F. Havet, R. J. Kang, and J.-S. Sereni. Improper colouring of unit disk graphs. In Proceedings of the 7th International Conference on Graph Theory (ICGT'05), volume 22 of Electronic Notes in Discrete Mathematics, pages 123--128, September 2005. Elsevier. [WWW ] [PDF ] [bibtex-entry]


13. F. Havet and J.-S. Sereni. Channel assignment and improper choosability of graphs. In Proceedings of the 31st Workshop on Graph-Theoretic Concepts in Computer Science (WG'05), volume 3787 of Lecture Notes in Computer Science, pages 81--90, June 2005. Springer Verlag. [WWW ] [PDF ] [bibtex-entry]


14. J.-C. Bermond, O. Delmas, F. Havet, M. Montassier, and S. Pérennes. Réseaux de télécommunications minimaux embarqués tolérants. In Conference ALGOTEL2003, Banyuls, May 2003, pages 27--32, 2003. [PDF ] [bibtex-entry]


15. F. Havet. Design of Fault Tolerant Satellite Networks with Priorities via Selectors. In Proc. of SIROCCO'02, Andros, Greece, pages 165--180, June 2002. [bibtex-entry]


16. F. Havet. Robustness of a Routing Tree for the Push Tree Problem. In $4^{e}$ rencontres francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'02), Mèze, France, pages 81--86, May 2002. [bibtex-entry]


17. J.-C. Bermond, F. Havet, and D. Tóth. Design of fault tolerant on board networks with priorities. In $3^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2001), Saint-Jean-de-Luz , France, pages 95--98, Mai 2001. [bibtex-entry]


18. S. Céroi and F. Havet. Trees with three leaves are (n + 1)-unavoidable. In Jayme Szwarcfiter and Siang Song, editors, Electronic Notes in Discrete Mathematics, volume 7, 2001. Elsevier Science Publishers. [bibtex-entry]


19. F. Havet and M. Wennink. The Push Tree Problem. In SPAA'01: 13th ACM Symposium on Parallel Algorithms and Architectures, Crète , Grèce, pages 318--319, Juillet 2001. [bibtex-entry]

1. J. Bang-Jensen, F. Havet, and A. K. Maia. Finding a subdivision of a digraph. Technical report RR-8024, INRIA, July 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]


2. V. Campos, F. Havet, R. Sampaio, and A. Silva. Backbone colouring: tree backbones with small diameter in planar graphs. Technical report RR-8151, INRIA, November 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]


3. F. Havet and A. D. King. List circular backbone colouring. Technical report RR-8159, INRIA, November 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]


4. F. Havet, A. D. King, M. Liedloff, and I. Todinca. (Circular) backbone colouring: tree backbones in planar graphs. Technical report RR-8152, INRIA, November 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]


5. F. Havet, A. K. Maia, and M. Yu. Complexity of greedy edge-colouring. Technical report RR-8171, INRIA, December 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]


6. F. Havet, N. Paramaguru, and R. Sampathkumar. Detection number of bipartite graphs and cubic graphs. Technical report RR-8115, INRIA, October 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]


7. P. Aboulker, F. Havet, and N. Trotignon. On wheel-free graphs. Research Report RR-7651, INRIA, June 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]


8. L. Addario-Berry, F. Havet, C. Linhares Sales, B. Reed, and S. Thomassé. Oriented trees in digraphs. Research Report 7502, INRIA, 01 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]


9. J. Araujo, J-C. Bermond, F. Giroire, F. Havet, D. Mazauric, and R. Modrzejewski. Weighted Improper Colouring. Research Report RR-7590, INRIA, 04 2011. [WWW ] [PDF ]
   Keywords: graph colouring, improper colouring, grids, integer programming, algorithms. [Abstract] [bibtex-entry]


10. S. Bessy and F. Havet. Enumerating the edge-colourings and total colourings of a regular graph. Research Report RR-7652, INRIA, June 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]


11. V. Campos and F. Havet. 5-choosability of graphs with 2 crossings. Research Report RR-7618, INRIA, 05 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]


12. J. G. Chang, F. Havet, M. Montassier, and A. Raspaud. Steinberg's Conjecture and near-colorings. Rapport de recherche RR-7669, INRIA, 7 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]


13. F. Havet and X. Zhu. The game Grundy number of graphs. Rapport de recherche RR-7646, INRIA, June 2011. [WWW ] [PDF ]
    Keywords: colouring game, game Grundy number, trees, partial 2-trees. [Abstract] [bibtex-entry]


14. J. Bang-Jensen, F. Havet, and N. Trotignon. Finding an induced subdivision of a digraph. Research Report 7430, INRIA, 10 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]


15. J-C. Bermond, F. Havet, F. Huc, and C. Linhares Sales. Improper colouring of weighted grid and hexagonal graphs. Research Report RR-7250, INRIA, April 2010. [WWW ] [PDF ]
    Keywords: Improper colouring, Weighted colouring, Approximation algorithms. [Abstract] [bibtex-entry]


16. V. Campos, A. Gyárfás, F. Havet, C. Linhares Sales, and F. Maffray. New bounds on the Grundy number of products of graphs. Research Report 7243, INRIA, April 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]


17. N. Cohen and F. Havet. Linear and 2-frugal choosability of graphs of small maximum average degree. Research Report RR-7213, INRIA, 02 2010. [WWW ] [Abstract] [bibtex-entry]


18. F. Havet, C. Linhares Sales, and L. Sampaio. b-coloring of tight graphs. Research Report 7241, INRIA, March 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]


19. J. Araujo, N. Cohen, F. Giroire, and F. Havet. Good edge-labelling of graphs. Research Report 6934, INRIA, 2009. [WWW ] [PDF ]
    Keywords: graph theory, complexity, edge-labelling, planar graphs, matching-cut, channel assignment. [Abstract] [bibtex-entry]


20. N. Cohen and F. Havet. Planar graphs with maximum degree $\Delta\geq 9$ are ($\Delta+1$)-edge-choosable -- short proof. Research Report RR-7098, November 2009. [WWW ]
    Keywords: edge-colouring, list colouring, List Colouring Conjecture, planar graphs. [Abstract] [bibtex-entry]


21. N. Cohen, F. Havet, and T. Müller. Acyclic edge-colouring of planar graphs. Research Report 6876, INRIA, March 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


22. N. Eggemann, F. Havet, and S. Noble. $k$-$L(2,1)$-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. Research Report 6840, INRIA, February 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


23. R. Erman, F. Havet, B. Lidicky, and O. Pangrác. 5-colouring graphs with 4 crossings. Research Report 7110, INRIA, November 2009. [Abstract] [bibtex-entry]


24. F. Havet, S. Jendrol', R. Soták, and E. Skrabul'aková. Facial non-repetitive edge-colouring of plane graphs. Research Report 6873, INRIA, February 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


25. M. Asté, F. Havet, and C. Linhares-Sales. Grundy number and products of graphs. Research Report RR-6672, INRIA, October 2008. [PDF ] [Abstract] [bibtex-entry]


26. R. Correa, F. Havet, and J.-S. Sereni. About a Brooks-type theorem for improper colouring. Research Report RR-6432, INRIA, January 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]


27. F. Havet, M. Klazar, J. Kratochvil, D. Kratsch, and M. Liedloff. Exact algorithms for $L(2,1)$-labelling. Research Report RR-6587, INRIA, 07 2008. [Abstract] [bibtex-entry]


28. F. Havet, D. Král, J.-S. Sereni, and R. Skrekovski. Facial coloring using Hall's Theorem. Research Report 383, ITI-series, 2008. [PDF ] [Abstract] [bibtex-entry]


29. F. Havet, B. Reed, and J.-S. Sereni. $L(p,1)$-labelling of graphs. Research Report RR-6673, INRIA, October 2008. [PDF ] [Abstract] [bibtex-entry]


30. F. Havet, J. van den Heuvel, C. McDiarmid, and B. Reed. List Colouring Squares of Planar Graphs. Research Report RR-6586, INRIA, July 2008. [Abstract] [bibtex-entry]


31. O. Amini, F. Havet, F. Huc, and S. Thomassé. WDM and Directed Star Arboricity. Research Report 6179, INRIA, January 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]


32. F. Havet, R. Kang, and J.-S. Sereni. Improper colouring of unit disk graphs. Research Report 6206, INRIA, May 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]


33. F. Havet and S. Thomasse. Complexity of $(p,1)$-total labelling. Research Report 6305, INRIA, September 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]


34. O. Delmas, F. Havet, M. Montassier, and S. Pérennes. Design of fault tolerant on-board networks. Research report, INRIA Research Report 5866, March 2006. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]


35. F. Havet. Choosability of the square of planar subcubic graphs with large girth. Research report, INRIA Research Report 5800 and I3S Research Report I3S/RR-2006-01-FR, January 2006.
    Note: Submitted to Discrete Mathematics. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]


36. F. Havet, R. J. Kang, T. Müller, and J.-S. Sereni. Circular Choosability. Research report, INRIA Research Report 5957 and I3S Research Report I3S/RR-2006-21-FR, July 2006.
    Note: Submitted to Journal of Graph Theory. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]


37. F. Havet, J.-S. Sereni, and R. Skrekovski. 3-facial colouring of plane graphs. Research report, INRIA Research Report 5943 and I3S Research Report I3S/RR-2006-20-FR, July 2006.
    Note: Submitted to SIAM Journal on Discrete Mathematics. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]


38. F. Havet, S. Thomassé, and A. Yeo. Hoàng-Reed conjecture holds for tournaments. Research report, INRIA Research Report 5976, September 2006.
    Note: Submitted Discrete Mathematics. [WWW ] [PDF ] [Abstract] [bibtex-entry]


39. L. Addario-Berry, F. Havet, and S. Thomassé. Paths with two blocks in $n$-chromatic digraphs. Research report, INRIA Research Report 5688 and I3S Research Report I3S/RR-2005-27-FR, 2005. [WWW ] [PDF ] [POSTSCRIPT ] [bibtex-entry]


40. F. Havet. Repartitors, selectors and superselectors. Research report, INRIA Research Report 5686, 2005. [WWW ] [PDF ] [POSTSCRIPT ] [bibtex-entry]


41. J.-C. Bermond, F. Havet, and C. D. Tóth. Fault tolerant on-board networks with priorities. Research Report RR-5363, INRIA, 2004 route des lucioles - BP 93 - FR-06902 Sophia Antipolis, November 2004. [WWW ] [PDF ] [POSTSCRIPT ] [bibtex-entry]


42. S. Bessy, E. Birmelé, and F. Havet. Arc-chromatic number of digraphs in which each vertex has bounded outdegree or bounded indegree. Research Report RR-5364, INRIA, 2004 route des lucioles - BP 93 - FR-06902 Sophia Antipolis, November 2004. [WWW ] [PDF ] [POSTSCRIPT ] [bibtex-entry]


43. F. Havet and J.-S. Sereni. Improper choosability of graphs and maximum average degree. Research report, INRIA Research Report 5164 and I3S Research Report I3S/RR-2004-11-FR, April 2004. [WWW ] [PDF ] [POSTSCRIPT ] [bibtex-entry]


44. F. Havet. Stable set meeting every longest path. Research Report, INRIA Research Report 5009 and I3S Research Report I3S/RR-2003-29-FR, 2003. [WWW ] [PDF ] [bibtex-entry]


45. F. Havet. Upper bound for the span of (s,1)-total labelling of graphs. Research Report, INRIA Research Report 4816 and I3S Research Report I3S/RR-2003-13-FR, 2003. [WWW ] [PDF ] [bibtex-entry]


46. S. Bessy, F. Havet, and J. Palaysi. Pancyclic Arcs and Connectivity in Tournaments. Rapport de recherche INRIA/RR-4522, Projet MASCOTTE, Sophia Antipolis, August 2002. [bibtex-entry]


47. F. Havet. Pancyclic Arcs and Connectivity in Tournaments. Rapport de recherche INRIA/RR-4378, Projet MASCOTTE, Sophia Antipolis, March 2002. [bibtex-entry]


48. F. Havet and J. Yu. On $(d,1)$-total labelling of graphs. Rapport de recherche INRIA, Projet MASCOTTE, Sophia Antipolis, November 2002. [bibtex-entry]

This document was translated from BibT_EX by bibtex2html