Louis Esperet

From MaRDI portal
Person:252835

Available identifiers

zbMath Open esperet.louisMaRDI QIDQ252835

List of research outcomes

PublicationDate of PublicationType
Optimization in graphical small cancellation theory2024-02-19Paper
Sparse universal graphs for planarity2023-12-02Paper
Local certification of geometric graph classes2023-11-28Paper
Optimal labelling schemes for adjacency, comparability, and reachability2023-11-14Paper
Single‐conflict colouring2023-09-29Paper
Proof of the Clustered Hadwiger Conjecture2023-06-09Paper
The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem2023-04-04Paper
Clustered 3-colouring graphs of bounded degree2023-03-31Paper
Distributed coloring and the local structure of unit-disk graphs2023-01-30Paper
Adjacency Labelling for Planar Graphs (and Beyond)2022-12-08Paper
https://portal.mardi4nfdi.de/entity/Q50904562022-07-18Paper
Distributed coloring and the local structure of unit-disk graphs2022-06-24Paper
Optimal Adjacency Labels for Subgraphs of Cartesian Products2022-06-06Paper
Antifactors in bipartite multigraphs2022-05-30Paper
Colouring Strong Products2022-05-10Paper
Local boxicity2022-04-07Paper
Distributed algorithms for fractional coloring2022-03-22Paper
Local certification of graphs on surfaces2022-03-01Paper
Sketching Distances in Monotone Graph Classes2022-02-18Paper
Testability and local certification of monotone properties in minor-closed classes2022-02-01Paper
Packing and covering balls in graphs excluding a minor2021-08-03Paper
Isometric Universal Graphs2021-06-10Paper
Local certification of graphs on surfaces2021-02-08Paper
Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces2020-12-04Paper
Distributed algorithms for fractional coloring2020-12-03Paper
Planar graphs have bounded nonrepetitive chromatic number2020-10-20Paper
Surfaces have (asymptotic) dimension 22020-07-07Paper
Bipartite complements of circle graphs2020-04-21Paper
Local approximation of the maximum cut in regular graphs2020-04-21Paper
Separation Choosability and Dense Bipartite Induced Subgraphs2020-04-06Paper
Exact Distance Colouring in Trees2020-03-11Paper
Clustered 3-Colouring Graphs of Bounded Degree2020-02-26Paper
Local approximation of the maximum cut in regular graphs2020-02-24Paper
Distributed coloring in sparse graphs with fewer colors2019-11-15Paper
https://portal.mardi4nfdi.de/entity/Q51980632019-10-02Paper
Distributed Coloring in Sparse Graphs with Fewer Colors2019-09-19Paper
Improper coloring of graphs on surfaces2019-06-14Paper
Boxicity, poset dimension, and excluded minors2019-03-05Paper
Coloring graphs with no induced subdivision of $K_4^+$2019-01-14Paper
The width of quadrangulations of the projective plane2018-10-31Paper
Distributed coloring of graphs with an optimal number of colors2018-09-21Paper
Single-conflict colouring2018-03-29Paper
Additive Bases and Flows in Graphs2018-02-22Paper
Additive bases and flows in graphs2018-01-18Paper
Polynomial expansion and sublinear separators2017-12-21Paper
Flows and Bisections in Cubic Graphs2017-09-26Paper
Coloring Jordan Regions and Curves2017-08-14Paper
Small feedback vertex sets in planar digraphs2017-05-18Paper
Box representations of embedded graphs2017-05-11Paper
Graphs with No Induced Five‐Vertex Path or Antipath2017-04-21Paper
Long induced paths in graphs2017-03-28Paper
Coloring non-crossing strings2016-12-06Paper
The structure of graphs with circular flow number 5 or more, and the complexity of their recognition problem2016-05-25Paper
Restricted frame graphs and a conjecture of Scott2016-03-04Paper
Islands in Graphs on Surfaces2016-02-05Paper
Boxicity and topological invariants2015-09-30Paper
Equitable partition of graphs into induced forests2015-04-29Paper
On the maximum fraction of edges covered by \(t\) perfect matchings in a cubic bridgeless graph2015-04-29Paper
On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings2014-10-09Paper
List-coloring claw-free graphs with small clique number2014-09-19Paper
Colouring Planar Graphs With Three Colours and No Large Monochromatic Components2014-08-06Paper
On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings2014-06-11Paper
Acyclic edge-coloring using entropy compression2014-04-11Paper
Distance-two coloring of sparse graphs2014-03-25Paper
A unified approach to distance-two colouring of graphs on surfaces2014-03-17Paper
Coloring a set of touching strings2013-10-10Paper
Cubic bridgeless graphs have more than a linear number of perfect matchings2013-10-10Paper
Fire Containment in Planar Graphs2013-07-31Paper
Boxicity of graphs on surfaces2013-06-26Paper
A Complexity Dichotomy for the Coloring of Sparse Graphs2013-05-21Paper
The chromatic number of \(\{P_5,K_4\}\)-free graphs2013-03-19Paper
Locally identifying coloring of graphs2012-10-24Paper
A superlinear bound on the number of perfect matchings in cubic bridgeless graphs2012-05-04Paper
Exponentially many perfect matchings in cubic graphs2011-07-25Paper
Covering line graphs with equivalence relations2010-11-25Paper
Dynamic list coloring of bipartite graphs2010-11-25Paper
https://portal.mardi4nfdi.de/entity/Q35766682010-07-30Paper
An improved linear bound on the number of perfect matchings in cubic graphs2010-06-17Paper
On induced-universal graphs for the class of bounded-degree graphs2010-06-09Paper
Acyclic improper colourings of graphs with bounded maximum degree2010-03-29Paper
Oriented colorings of 2-outerplanar graphs2010-01-29Paper
Adapted list coloring of planar graphs2009-12-18Paper
Game colouring of the square of graphs2009-12-10Paper
Islands in Graphs on Surfaces2009-06-19Paper
Boxicity of graphs with bounded degree2009-06-17Paper
Linear choosability of graphs2008-07-11Paper
On circle graphs with girth at least five2008-06-05Paper
Acyclic improper choosability of graphs2007-05-29Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Louis Esperet