The following pages link to Louis Esperet (Q252835):
Displaying 50 items.
- Restricted frame graphs and a conjecture of Scott (Q252837) (← links)
- The structure of graphs with circular flow number 5 or more, and the complexity of their recognition problem (Q286768) (← links)
- A superlinear bound on the number of perfect matchings in cubic bridgeless graphs (Q412270) (← links)
- Locally identifying coloring of graphs (Q456289) (← links)
- Boxicity and topological invariants (Q499501) (← links)
- Long induced paths in graphs (Q518170) (← links)
- Box representations of embedded graphs (Q527439) (← links)
- Small feedback vertex sets in planar digraphs (Q528978) (← links)
- Exponentially many perfect matchings in cubic graphs (Q555602) (← links)
- Covering line graphs with equivalence relations (Q608272) (← links)
- Dynamic list coloring of bipartite graphs (Q608280) (← links)
- Boxicity, poset dimension, and excluded minors (Q668021) (← links)
- Coloring non-crossing strings (Q727171) (← links)
- List-coloring claw-free graphs with small clique number (Q742576) (← links)
- Oriented colorings of 2-outerplanar graphs (Q845933) (← links)
- Linear choosability of graphs (Q932648) (← links)
- Acyclic improper colourings of graphs with bounded maximum degree (Q960917) (← links)
- On induced-universal graphs for the class of bounded-degree graphs (Q975466) (← links)
- An improved linear bound on the number of perfect matchings in cubic graphs (Q976154) (← links)
- Boxicity of graphs with bounded degree (Q1024326) (← links)
- Game colouring of the square of graphs (Q1043984) (← links)
- Polynomial expansion and sublinear separators (Q1686248) (← links)
- Additive bases and flows in graphs (Q1689948) (← links)
- The chromatic number of \(\{P_5,K_4\}\)-free graphs (Q1942664) (← links)
- Packing and covering balls in graphs excluding a minor (Q2043760) (← links)
- Local certification of graphs on surfaces (Q2078616) (← links)
- Distributed algorithms for fractional coloring (Q2117704) (← links)
- Local boxicity (Q2122684) (← links)
- Bipartite complements of circle graphs (Q2174578) (← links)
- Distributed coloring in sparse graphs with fewer colors (Q2335690) (← links)
- Equitable partition of graphs into induced forests (Q2342637) (← links)
- On the maximum fraction of edges covered by \(t\) perfect matchings in a cubic bridgeless graph (Q2342641) (← links)
- Boxicity of graphs on surfaces (Q2376090) (← links)
- A unified approach to distance-two colouring of graphs on surfaces (Q2439826) (← links)
- Distance-two coloring of sparse graphs (Q2441647) (← links)
- Acyclic edge-coloring using entropy compression (Q2444732) (← links)
- Coloring a set of touching strings (Q2851465) (← links)
- Cubic bridgeless graphs have more than a linear number of perfect matchings (Q2851496) (← links)
- On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings (Q2922223) (← links)
- Graphs with No Induced Five‐Vertex Path or Antipath (Q2978172) (← links)
- Acyclic improper choosability of graphs (Q3439591) (← links)
- (Q3576668) (← links)
- Adapted list coloring of planar graphs (Q3652546) (← links)
- The width of quadrangulations of the projective plane (Q4553729) (← links)
- Additive Bases and Flows in Graphs (Q4605444) (← links)
- A Complexity Dichotomy for the Coloring of Sparse Graphs (Q4920652) (← links)
- Isometric Universal Graphs (Q4992841) (← links)
- Adjacency Labelling for Planar Graphs (and Beyond) (Q5056430) (← links)
- (Q5090456) (← links)
- Planar graphs have bounded nonrepetitive chromatic number (Q5126756) (← links)
