Nombre de documents

48

CV de Louis Esperet


Article dans une revue33 documents

  • Louis Esperet, Laetitia Lemoine, Frédéric Maffray. Long induced paths in graphs. European Journal of Combinatorics, Elsevier, 2017, 62, pp.1-14. <10.1016/j.ejc.2016.11.011>. <hal-01277671>
  • Maria Chudnovsky, Louis Esperet, Laetitia Lemoine, Peter Maceli, Frédéric Maffray, et al.. Graphs with No Induced Five-Vertex Path or Antipath. Journal of Graph Theory, Wiley, 2017, 84 (3), pp.221-232. <10.1002/jgt.22022>. <hal-01438308>
  • Louis Esperet, Giuseppe Mazzuoccolo, Michael Tarsi. The structure of graphs with Circular flow number 5 or more, and the complexity of their recognition problem. Journal of Combinatorics, International Press, 2016, 7 (2), pp.453-479. <10.4310/JOC.2016.v7.n2.a12>. <hal-01119817>
  • Louis Esperet. Boxicity and topological invariants. European Journal of Combinatorics, Elsevier, 2016, 51, pp.495-499. <10.1016/j.ejc.2015.07.020>. <hal-01133817>
  • Jérémie Chalopin, Louis Esperet, Zhentao Li, Patrice Ossona de Mendez. Restricted frame graphs and a conjecture of Scott. Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 2016, 23 (1), pp.#P1.30. <hal-01119809>
  • Louis Esperet, Daniel Gonçalves, Arnaud Labourel. Coloring non-crossing strings. Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 2016, 23 (4), pp.#P4.4. <http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i4p4>. <hal-01229012>
  • Louis Esperet, Pascal Ochem. Islands in graphs on surfaces. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2016, 30 (1), pp.206-219. <10.1137/140957883>. <hal-01119804>
  • Louis Esperet, Giuseppe Mazzuoccolo. On the maximum fraction of edges covered by t perfect matchings in a cubic bridgeless graph. Discrete Mathematics, Elsevier, 2015, 338 (8), pp.1509-1514. <10.1016/j.disc.2015.03.017>. <hal-01146177>
  • Louis Esperet, Laetitia Lemoine, Frédéric Maffray. Equitable partition of graphs into induced forests. Discrete Mathematics, Elsevier, 2015, 338 (8), pp.1481-1483. <10.1016/j.disc.2015.03.019>. <hal-01119813>
  • Louis Esperet, Andras Gyarfas, Frédéric Maffray. List-Coloring Claw-Free Graphs with Small Clique Number. Graphs and Combinatorics, Springer Verlag, 2014, 30 (2), pp.365-375. <10.1007/s00373-012-1272-x>. <hal-00949817>
  • Louis Esperet, Gwenaël Joret. Coloring planar graphs with three colors and no large monochromatic components. Combinatorics, Probability and Computing, Cambridge University Press (CUP), 2014, 23 (4), pp.551-570. <10.1017/S0963548314000170>. <hal-01020703>
  • Zdenek Dvorak, Louis Esperet. Distance-two coloring of sparse graphs. European Journal of Combinatorics, Elsevier, 2014, 36, pp.406-415. <10.1016/j.ejc.2013.09.002>. <hal-00924022>
  • Louis Esperet, Giuseppe Mazzuoccolo. On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings. Journal of Graph Theory, Wiley, 2014, 77 (2), pp.144-157. <10.1002/jgt.21778>. <hal-01061432>
  • Louis Esperet, Laetitia Lemoine, Frédéric Maffray, Grégory Morel. The chromatic number of {P5, K4}-free graphs. Discrete Mathematics, Elsevier, 2013, 313 (6), pp.743-754. <hal-00787627>
  • Louis Esperet, Jan Van den Heuvel, Frédéric Maffray, Félix Sipma. Fire Containment in Planar Graphs. Journal of Graph Theory, Wiley, 2013, 73 (3), pp.267-279. <10.1002/jgt.21673>. <hal-00843777>
  • Omid Amini, Louis Esperet, Jan Van den Heuvel. A unified approach to distance-two colouring of graphs on surfaces. Combinatorica, Springer Verlag, 2013, 33 (3), pp.253-296. <10.1007/s00493-013-2573-2>. <hal-00924016>
  • Louis Esperet, Aline Parreau. Acyclic edge-coloring using entropy compression. European Journal of Combinatorics, Elsevier, 2013, 34 (6), pp.1019-1027. <10.1016/j.ejc.2013.02.007>. <hal-00843770>
  • Louis Esperet, Gwenaël Joret. Boxicity of graphs on surfaces. Graphs and Combinatorics, Springer Verlag, 2013, 29 (3), pp.417-427. <10.1007/s00373-012-1130-x>. <hal-00843774>
  • Louis Esperet, Mickaël Montassier, Pascal Ochem, Alexandre Pinlou. A Complexity Dichotomy for the Coloring of Sparse Graphs. Journal of Graph Theory, Wiley, 2013, 73 (1), pp.85-102. <http://dx.doi.org/10.1002/jgt.21659>. <10.1002/jgt.21659>. <lirmm-00736468>
  • Louis Esperet, František Kardoš, Daniel Kráľ. A superlinear bound on the number of perfect matchings in cubic bridgeless graphs. European Journal of Combinatorics, Elsevier, 2012, 33 (5), pp.767-798. <10.1016/j.ejc.2011.09.027>. <hal-00635917>
  • Louis Esperet, Sylvain Gravier, Mickael Montassier, Pascal Ochem, Aline Parreau. Locally identifying coloring of graphs. Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 2012, 19 (2), pp.40. <hal-00529640v2>
  • Louis Esperet, František Kardoš, Andrew King, Daniel Kráľ, Sergey Norine. Exponentially many perfect matchings in cubic graphs. Advances in Mathematics, Elsevier, 2011, 227 (4), pp.1646-1664. <10.1016/j.aim.2011.03.015>. <hal-00625682>
  • Louis Esperet, John Gimbel, Andrew King. Covering line graphs with equivalence relations. Discrete Applied Mathematics, Elsevier, 2010, 158 (17), pp.1902-1907. <10.1016/j.dam.2010.08.012>. <inria-00528133>
  • Louigi Addario-Berry, Louis Esperet, Ross Kang, Colin Mcdiarmid, Alexandre Pinlou. Acyclic improper colourings of graphs with bounded maximum degree. Discrete Mathematics, Elsevier, 2010, 310 (2), pp.223-229. <10.1016/j.disc.2008.09.009>. <lirmm-00433038>
  • Louis Esperet. Dynamic list coloring of bipartite graphs. Discrete Applied Mathematics, Elsevier, 2010, 158 (17), pp.1963-1965. <10.1016/j.dam.2010.08.007>. <inria-00528134>
  • Louis Esperet, Daniel Kral, Peter Skoda, Riste Skrekovski. An improved linear bound on the number of perfect matchings in cubic graphs. European Journal of Combinatorics, Elsevier, 2010, 31 (5), pp.1316-1334. <10.1016/j.ejc.2009.11.008>. <inria-00528125>
  • Louis Esperet, Xuding Zhu. Game colouring of the square of graphs. Discrete Mathematics, Elsevier, 2009, 309 (13), pp.4514-4521. <10.1016/j.disc.2009.02.014>. <inria-00528116>
  • Louis Esperet, Pascal Ochem. On circle graphs with girth at least five. Discrete Mathematics, Elsevier, 2009, 309 (8), pp.2217-2222. <hal-00451863>
  • Louis Esperet. Boxicity of graphs with bounded degree. European Journal of Combinatorics, Elsevier, 2009, 30 (5), pp.1277-1280. <hal-00451866>
  • Louis Esperet, Mickael Montassier, Xuding Zhu. Adapted list colouring of planar graphs. Journal of Graph Theory, Wiley, 2009, 62 (2), pp.127-138. <hal-00349116>
  • Louis Esperet, Mickael Montassier, André Raspaud. Linear choosability of graphs. Discrete Mathematics, Elsevier, 2008, 308 (17), pp.3938-3950. <hal-00306479>
  • Louis Esperet, Arnaud Labourel, Pascal Ochem. On induced-universal graphs for the class of bounded-degree graphs. Information Processing Letters, Elsevier, 2008, 108 (5), pp.255-260. <10.1016/j.ipl.2008.04.020>. <hal-00368277>
  • Louis Esperet, Pascal Ochem. Oriented coloring of 2-outerplanar graphs. Information Processing Letters, Elsevier, 2007, 101, pp.215--219. <hal-00307156>

Rapport1 document

  • Omid Amini, Louis Esperet, Jan Van den Heuvel. Frugal Colouring of Graphs. [Research Report] RR-6178, INRIA. 2007, pp.12. <inria-00144318v2>

Pré-publication, Document de travail6 documents

  • Louis Esperet, Rémi De Joannis de Verclos, Tien-Nam Le, Stéphan Thomassé. Additive bases and flows in graphs. OSP. 2017. <hal-01433822>
  • Wouter Cames van Batenburg, Louis Esperet, Tobias Müller. Coloring Jordan regions and curves. OSP. 2016. <hal-01363824>
  • Louis Esperet, Laetitia Lemoine, Frédéric Maffray. Small feedback vertex sets in planar digraphs. OSP. 2016. <hal-01331988>
  • Ilkyoo Choi, Louis Esperet. Improper coloring of graphs on surfaces. OSP. 2016. <hal-01286447>
  • Louis Esperet. Box representations of embedded graphs. OSP. 2015. <hal-01240350>
  • Louis Esperet, Giuseppe Mazzuoccolo, Michael Tarsi. Flows and bisections in cubic graphs. OSP. 2015. <hal-01146166>

Communication dans un congrès7 documents

  • Louis Esperet, Giuseppe Mazzuoccolo. On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings. The Seventh European Conference on Combinatorics, Graph Theory and Applications (EuroComb'13), Sep 2013, Pise, Italy. 16, pp.47-51, 2013, <10.1007/978-88-7642-475-5_8>. <hal-00945884>
  • Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau. Identifying colorings of graphs. 8FCC, 2010, Orsay, France. <lirmm-01264347>
  • Louis Esperet, Frantisek Kardos, Daniel Kral. Cubic bridgeless graphs have more than a linear number of perfect matchings. European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009), 2009, Nancy, France. pp.411-415, 2009, <10.1016/j.endm.2009.07.068>. <hal-00451993>
  • Omid Amini, Louis Esperet, Jan Van den Heuvel. A Unified Approach to Distance-Two Colouring of Planar Graphs. ACM-SIAM Symposium on Discrete Algorithms 2009 (SODA09), 2009, New-York, United States. pp.273-282, 2009. <hal-00451999>
  • Louis Esperet, Daniel Gonçalves, Arnaud Labourel. Coloring a set of touching strings. EuroComb'09: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. Elsevier, 34, pp.213-217, 2009, Electronic Notes in Discrete Mathematics. <lirmm-00433096>
  • Louis Esperet, Alexandre Pinlou. Acyclic improper choosability of graphs. CS06 - Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Jul 2006, Slovakia. Petr Hlineny, Jan Kratochvil, Roman Nedela and Martin Skoviera, 28, pp.251--258, 2006. <hal-00307157>
  • Louis Esperet, Mickael Montassier, André Raspaud. Linear choosability of graphs. Stefan Felsner. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. Discrete Mathematics and Theoretical Computer Science, AE, pp.99-104, 2005, DMTCS Proceedings. <hal-01184391>

Autre publication1 document

  • Louis Esperet, Mickael Montassier, André Raspaud. (d,1)-total labelling of sparse graphs. RR-1391-06. Rapport de Recherche RR-1391-06 LaBRI. 2006. <hal-00401711>