Frugal Colouring of Graphs - Omid Amini; Louis Esperet; Jan van den Heuvel (CoRR, 2007)

On circle graphs with girth at least five. - Louis Esperet; Pascal Ochem (Electron. Notes Discret. Math., 2007)

Acyclic improper choosability of graphs. - Louis Esperet; Alexandre Pinlou (Electron. Notes Discret. Math., 2007)

Oriented colorings of 2-outerplanar graphs. - Louis Esperet; Pascal Ochem (Inf. Process. Lett., 2007)

Linear choosability of graphs. - Louis Esperet; Mickaël Montassier; André Raspaud (Discret. Math., 2008)

On induced-universal graphs for the class of bounded-degree graphs. - Louis Esperet; Arnaud Labourel; Pascal Ochem (Inf. Process. Lett., 2008)

A unified approach to distance-two colouring of planar graphs. - Omid Amini; Louis Esperet; Jan van den Heuvel (SODA, 2009)

Game colouring of the square of graphs. - Louis Esperet; Xuding Zhu (Discret. Math., 2009)

Boxicity of graphs with bounded degree. - Louis Esperet (Eur. J. Comb., 2009)

Coloring a set of touching strings. - Louis Esperet; Daniel Gonçalves 001; Arnaud Labourel (Electron. Notes Discret. Math., 2009)

Cubic bridgeless graphs have more than a linear number of perfect matchings. - Louis Esperet; Frantisek Kardos; Daniel Král (Electron. Notes Discret. Math., 2009)

Adapted list coloring of planar graphs. - Louis Esperet; Mickaël Montassier; Xuding Zhu (J. Graph Theory, 2009)

Dynamic list coloring of bipartite graphs. - Louis Esperet (Discret. Appl. Math., 2010)

Covering line graphs with equivalence relations. - Louis Esperet; John Gimbel; Andrew D. King (Discret. Appl. Math., 2010)

Acyclic improper colourings of graphs with bounded maximum degree. - Louigi Addario-Berry; Louis Esperet; Ross J. Kang; Colin J. H. McDiarmid; Alexandre Pinlou (Discret. Math., 2010)

An improved linear bound on the number of perfect matchings in cubic graphs. - Louis Esperet; Daniel Král'; Petr Skoda 002; Riste Skrekovski (Eur. J. Comb., 2010)

Locally Identifying Coloring of Graphs. - Louis Esperet; Sylvain Gravier; Mickaël Montassier; Pascal Ochem; Aline Parreau (Electron. J. Comb., 2012)

A superlinear bound on the number of perfect matchings in cubic bridgeless graphs. - Louis Esperet; Frantisek Kardos; Daniel Král' (Eur. J. Comb., 2012)

A unified approach to distance-two colouring of graphs on surfaces. - Omid Amini; Louis Esperet; Jan van den Heuvel (Comb., 2013)

Coloring planar graphs with three colors and no large monochromatic components - Louis Esperet; Gwenaël Joret (CoRR, 2013)

The chromatic number of {P5, K4}-free graphs. - Louis Esperet; Laetitia Lemoine; Frédéric Maffray; Grégory Morel (Discret. Math., 2013)

Acyclic edge-coloring using entropy compression. - Louis Esperet; Aline Parreau (Eur. J. Comb., 2013)

Boxicity of Graphs on Surfaces. - Louis Esperet; Gwenaël Joret (Graphs Comb., 2013)

Fire Containment in Planar Graphs. - Louis Esperet; Jan van den Heuvel; Frédéric Maffray; Félix Sipma (J. Graph Theory, 2013)

A Complexity Dichotomy for the Coloring of Sparse Graphs. - Louis Esperet; Mickaël Montassier; Pascal Ochem; Alexandre Pinlou (J. Graph Theory, 2013)

Colouring Planar Graphs With Three Colours and No Large Monochromatic Components. - Louis Esperet; Gwenaël Joret (Comb. Probab. Comput., 2014)

Distance-two coloring of sparse graphs. - Zdenek Dvorák 001; Louis Esperet (Eur. J. Comb., 2014)

List-Coloring Claw-Free Graphs with Small Clique Number. - Louis Esperet; András Gyárfás; Frédéric Maffray (Graphs Comb., 2014)

On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings. - Louis Esperet; Giuseppe Mazzuoccolo (J. Graph Theory, 2014)

Equitable partition of graphs into induced forests. - Louis Esperet; Laetitia Lemoine; Frédéric Maffray (Discret. Math., 2015)

On the maximum fraction of edges covered by t perfect matchings in a cubic bridgeless graph. - Louis Esperet; Giuseppe Mazzuoccolo (Discret. Math., 2015)

Restricted Frame Graphs and a Conjecture of Scott. - Jérémie Chalopin; Louis Esperet; Zhentao Li; Patrice Ossona de Mendez (Electron. J. Comb., 2016)

Coloring Non-Crossing Strings. - Louis Esperet; Daniel Gonçalves 001; Arnaud Labourel (Electron. J. Comb., 2016)

Coloring pseudo-disks and Jordan curves. - Wouter Cames van Batenburg; Louis Esperet; Tobias Müller (CoRR, 2016)

Boxicity and topological invariants. - Louis Esperet (Eur. J. Comb., 2016)

Islands in Graphs on Surfaces. - Louis Esperet; Pascal Ochem (SIAM J. Discret. Math., 2016)

Graph colorings, flows and perfect matchings. (Coloration de graphes, flots, et couplages parfaits). - Louis Esperet (2017)

Small Feedback Vertex Sets in Planar Digraphs. - Louis Esperet; Laetitia Lemoine; Frédéric Maffray (Electron. J. Comb., 2017)

Box Representations of Embedded Graphs. - Louis Esperet (Discret. Comput. Geom., 2017)

Long induced paths in graphs. - Louis Esperet; Laetitia Lemoine; Frédéric Maffray (Eur. J. Comb., 2017)

Additive bases and flows in graphs. - Louis Esperet; Rémi de Joannis de Verclos; Tien-Nam Le; Stéphan Thomassé (Electron. Notes Discret. Math., 2017)

Graphs with No Induced Five-Vertex Path or Antipath. - Maria Chudnovsky; Louis Esperet; Laetitia Lemoine; Peter Maceli; Frédéric Maffray; Irena Penev (J. Graph Theory, 2017)

Flows and Bisections in Cubic Graphs. - Louis Esperet; Giuseppe Mazzuoccolo; Michael Tarsi (J. Graph Theory, 2017)

Coloring Jordan Regions and Curves. - Wouter Cames van Batenburg; Louis Esperet; Tobias Müller (SIAM J. Discret. Math., 2017)

Boxicity, Poset Dimension, and Excluded Minors. - Louis Esperet; Veit Wiechert (Electron. J. Comb., 2018)

Least conflict choosability. - Zdenek Dvorák 001; Louis Esperet; Ross J. Kang; Kenta Ozeki (CoRR, 2018)

Polynomial expansion and sublinear separators. - Louis Esperet; Jean-Florent Raymond (Eur. J. Comb., 2018)

The width of quadrangulations of the projective plane. - Louis Esperet; Matej Stehlík (J. Graph Theory, 2018)

Distributed Coloring of Graphs with an Optimal Number of Colors. - Étienne Bamas; Louis Esperet (STACS, 2019)

Distributed Coloring in Sparse Graphs with Fewer Colors. - Pierre Aboulker; Marthe Bonamy; Nicolas Bousquet 001; Louis Esperet (Electron. J. Comb., 2019)

Planar graphs have bounded nonrepetitive chromatic number. - Vida Dujmovic; Louis Esperet; Gwenaël Joret; Bartosz Walczak; David R. Wood (CoRR, 2019)

Exact Distance Colouring in Trees. - Nicolas Bousquet 001; Louis Esperet; Ararat Harutyunyan; Rémi de Joannis de Verclos (Comb. Probab. Comput., 2019)

Separation Choosability and Dense Bipartite Induced Subgraphs. - Louis Esperet; Ross J. Kang; Stéphan Thomassé (Comb. Probab. Comput., 2019)

Improper coloring of graphs on surfaces. - Ilkyoo Choi; Louis Esperet (J. Graph Theory, 2019)

Sparse universal graphs for planarity. - Louis Esperet; Gwenaël Joret; Pat Morin (CoRR, 2020)

Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces. - Marthe Bonamy; Nicolas Bousquet 001; Louis Esperet; Carla Groenland; Chun-Hung Liu; François Pirot; Alex D. Scott (CoRR, 2020)

Bipartite complements of circle graphs. - Louis Esperet; Matej Stehlík (Discret. Math., 2020)

Local approximation of the Maximum Cut in regular graphs. - Étienne Bamas; Louis Esperet (Theor. Comput. Sci., 2020)

Distributed Algorithms for Fractional Coloring. - Nicolas Bousquet 001; Louis Esperet; François Pirot (SIROCCO, 2021)

Optimal labelling schemes for adjacency, comparability, and reachability. - Marthe Bonamy; Louis Esperet; Carla Groenland; Alex D. Scott (STOC, 2021)

Packing and Covering Balls in Graphs Excluding a Minor. - Nicolas Bousquet 001; Wouter Cames van Batenburg; Louis Esperet; Gwenaël Joret; William Lochet; Carole Muller; François Pirot (Comb., 2021)

Adjacency Labelling for Planar Graphs (and Beyond). - Vida Dujmovic; Louis Esperet; Cyril Gavoille; Gwenaël Joret; Piotr Micek; Pat Morin (J. ACM, 2021)

Single-conflict colouring. - Zdenek Dvorák 001; Louis Esperet; Ross J. Kang; Kenta Ozeki (J. Graph Theory, 2021)

Isometric Universal Graphs. - Louis Esperet; Cyril Gavoille; Carla Groenland (SIAM J. Discret. Math., 2021)

Sketching Distances in Monotone Graph Classes. - Louis Esperet; Nathaniel Harms; Andrey Kupavskii (APPROX/RANDOM, 2022)

Testability and Local Certification of Monotone Properties in Minor-Closed Classes. - Louis Esperet; Sergey Norin (ICALP, 2022)

Clustered 3-colouring graphs of bounded degree. - Vida Dujmovic; Louis Esperet; Pat Morin; Bartosz Walczak; David R. Wood (Comb. Probab. Comput., 2022)

Local boxicity. - Louis Esperet; Lyuben Lichev (Eur. J. Comb., 2022)

Local certification of graphs on surfaces. - Louis Esperet; Benjamin Lévêque (Theor. Comput. Sci., 2022)

Proof of the Clustered Hadwiger Conjecture. - Vida Dujmovic; Louis Esperet; Pat Morin; David R. Wood (FOCS, 2023)

Distributed coloring and the local structure of unit-disk graphs. - Louis Esperet; Sébastien Julliot; Arnaud de Mesmay (Theor. Comput. Sci., 2023)

Local Certification of Geometric Graph Classes. - Oscar Defrain; Louis Esperet; Aurélie Lagoutte; Pat Morin; Jean-Florent Raymond (MFCS, 2024)

Coarse Geometry of Quasi-Transitive Graphs Beyond Planarity. - Louis Esperet; Ugo Giocanti (Electron. J. Comb., 2024)

Renaming in distributed certification. - Nicolas Bousquet 001; Louis Esperet; Laurent Feuilloley; Sébastien Zeitoun (CoRR, 2024)

Long induced paths in sparse graphs and graphs with forbidden patterns. - Julien Duron; Louis Esperet; Jean-Florent Raymond (CoRR, 2024)

Long induced paths and forbidden patterns: Polylogarithmic bounds. - Julien Duron; Louis Esperet; Jean-Florent Raymond (CoRR, 2024)

Colouring strong products. - Louis Esperet; David R. Wood (Eur. J. Comb., 2024)

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. - Marthe Bonamy; Édouard Bonnet; Hugues Déprés; Louis Esperet; Colin Geniet; Claire Hilaire; Stéphan Thomassé; Alexandra Wesolek (J. Comb. Theory B, 2024)

The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem. - Louis Esperet; Ugo Giocanti; Clément Legrand-Duchesne (J. Comb. Theory B, 2024)

Optimal Adjacency Labels for Subgraphs of Cartesian Products. - Louis Esperet; Nathaniel Harms; Viktor Zamaraev (SIAM J. Discret. Math., 2024)

Optimization in graphical small cancellation theory. - Louis Esperet; Ugo Giocanti (Discret. Math., 2024)

Reductions in local certification. - Louis Esperet; Sébastien Zeitoun (CoRR, 2025)

Faithful universal graphs for minor-closed classes. - Paul Bastide 002; Louis Esperet; Carla Groenland; Claire Hilaire; Clément Rambaud; Alexandra Wesolek (CoRR, 2025)