activity
20052019
most citedDetecting induced subgraphs

51 citations · 110 across the 15 of their papers we have counts for

collaborators

20 papers

cs.DM2019

Homothetic triangle representations of planar graphs

Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou

We prove that every planar graph is the intersection graph of homothetic triangles in the plane.

math.CO2019

A bijection for essentially 3-connected toroidal maps

Nicolas Bonichon, Éric Fusy, Benjamin Lévêque

We present a bijection for toroidal maps that are essentially -connected (-connected in the periodic planar representation). Our construction actually proceeds on certain clo…

cs.DM2019

Scaling limits for random triangulations on the torus

Vincent Beffara, Cong Bang Huynh, Benjamin Lévêque

We study the scaling limit of essentially simple triangulations on the torus. We consider, for every , a uniformly random triangulation over the set of (appropriatel…

math.CO2018

Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth

Éric Fusy, Benjamin Lévêque

We present unified bijections for maps on the torus with control on the face-degrees and essential girth (girth of the periodic planar representation). A first step is to show that…

cs.DM2017

A bijection for essentially 4-connected toroidal triangulations

Nicolas Bonichon, Benjamin Lévêque

Transversal structures (also known as regular edge labelings) are combinatorial structures defined over 4-connected plane triangulations with quadrangular outer-face. They have bee…

cs.DM2015

Encoding toroidal triangulations

Vincent Despré, Daniel Gonçalves, Benjamin Lévêque

Poulalhon and Schaeffer introduced an elegant method to linearly encode a planar triangulation optimally. The method is based on performing a special depth-first search algorithm o…