Benjamin Lévêque

According to our database1, Benjamin Lévêque authored at least 39 papers between 2005 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth.
J. Comb. Theory, Ser. A, 2020

2019
On the structure of Schnyder woods on orientable surfaces.
J. Comput. Geom., 2019

Homothetic triangle representations of planar graphs.
CoRR, 2019

A bijection for essentially 3-connected toroidal maps.
CoRR, 2019

Scaling limits for random triangulations on the torus.
CoRR, 2019

A Bijection for Essentially 4-Connected Toroidal Triangulations.
Electron. J. Comb., 2019

2017
Encoding Toroidal Triangulations.
Discret. Comput. Geom., 2017

Generalization of Schnyder woods to orientable surfaces and applications.
CoRR, 2017

2016
Planar graphs with Δ≥7 and no triangle adjacent to a C<sub>4</sub> are minimally edge and total choosable.
Discret. Math. Theor. Comput. Sci., 2016

Generalization of Schnyder woods to orientable surfaces and applications.
, 2016

2015
Asteroidal quadruples in non rooted path graphs.
Discuss. Math. Graph Theory, 2015

Structure of Schnyder labelings on orientable surfaces.
CoRR, 2015

2014
List coloring the square of sparse graphs with large degree.
Eur. J. Comb., 2014

Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorable.
Discret. Math., 2014

Toroidal Maps: Schnyder Woods, Orthogonal Surfaces and Straight-Line Representations.
Discret. Comput. Geom., 2014

Planar graphs with $Δ\geq 7$ and no triangle adjacent to a C<sub>4</sub> are minimally edge and total choosable.
CoRR, 2014

Contracting Graphs to Paths and Trees.
Algorithmica, 2014

2013
Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable
CoRR, 2013

2012
Coloring vertices of a graph or finding a Meyniel obstruction.
Theor. Comput. Sci., 2012

On graphs with no induced subdivision of K<sub>4</sub>.
J. Comb. Theory, Ser. B, 2012

Triangle Contact Representations and Duality.
Discret. Comput. Geom., 2012

2011
Characterizing directed path graphs by forbidden asteroids.
J. Graph Theory, 2011

Contracting chordal graphs and bipartite graphs to paths and trees.
Electron. Notes Discret. Math., 2011

2-distance coloring of sparse graphs.
Electron. Notes Discret. Math., 2011

2010
From Path Graphs to Directed Path Graphs.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

2009
Coloring Artemis graphs.
Theor. Comput. Sci., 2009

Characterizing path graphs by forbidden induced subgraphs.
J. Graph Theory, 2009

Graph transformations preserving the stability number.
Electron. Notes Discret. Math., 2009

Asteroids in rooted and directed path graphs.
Electron. Notes Discret. Math., 2009

2008
Coloring Bull-Free Perfectly Contractile Graphs.
SIAM J. Discret. Math., 2008

Approximations for All-to-All Uniform Traffic Grooming on Unidirectional Rings.
J. Interconnect. Networks, 2008

Generating All Sets With Bounded Unions.
Comb. Probab. Comput., 2008

2007
Coloration de graphes : structures et algorithmes. (Coloring graphs : structures and algorithms).
PhD thesis, 2007

Precoloring Extension of Co-Meyniel Graphs.
Graphs Comb., 2007

Detecting induced subgraphs.
Electron. Notes Discret. Math., 2007

Optimizing diversity.
Electron. Notes Discret. Math., 2007

2005
Coloring Meyniel graphs in linear time.
Electron. Notes Discret. Math., 2005

Coloring vertices of a graph or finding a Meyniel obstruction
CoRR, 2005

Precoloring co-Meyniel graphs
CoRR, 2005


  Loading...