Benjamin Lévêque

发表

Characterizing path graphs by forbidden induced subgraphs

M. Preissmann, Benjamin Lévêque, Frédéric Maffray, 2009 .

ANTS X: Proceedings of the Tenth Algorithmic Number Theory Symposium

Ariah Klages-Mundt, W. Stein, Benjamin Lévêque, 2013 .

A linear algorithm to find a strong stable set in a Meyniel graph

Benjamin Lévêque, Frédéric Maffray, 2005 .

On graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph

Benjamin Lévêque, Frédéric Maffray, Nicolas Trotignon, 2007 .

Toroidal Maps: Schnyder Woods, Orthogonal Surfaces and Straight-Line Representations

D. Gonçalves, Benjamin Lévêque, 2012, Discret. Comput. Geom..

A bijection for essentially 3-connected toroidal maps pdf

Nicolas Bonichon, Benjamin Lévêque, Éric Fusy, 2019, Eur. J. Comb..

Homothetic triangle representations of planar graphs pdf

Benjamin Lévêque, Alexandre Pinlou, Daniel Gonçalves, 2019, Journal of Graph Algorithms and Applications.

Coloring vertices of a graph or finding a Meyniel obstruction pdf

Kathie Cameron, Benjamin Lévêque, Frédéric Maffray, 2005, Theor. Comput. Sci..

Precoloring Extension of Co-Meyniel Graphs

Vincent Jost, Benjamin Lévêque, Frédéric Maffray, 2007, Graphs Comb..

Precoloring co-Meyniel graphs pdf

Vincent Jost, Benjamin Lévêque, Frédéric Maffray, 2005, ArXiv.

Contracting chordal graphs and bipartite graphs to paths and trees

Pim van 't Hof, Pinar Heggernes, Christophe Paul, 2011, Discret. Appl. Math..

From Path Graphs to Directed Path Graphs

Steven Chaplick, Benjamin Lévêque, Marisa Gutierrez, 2010, WG.

Characterizing path graphs by forbidden induced subgraphs pdf

Myriam Preissmann, Benjamin Lévêque, Frédéric Maffray, 2008, J. Graph Theory.

Generalization of Schnyder woods to orientable surfaces and applications pdf

Benjamin Lévêque, Benjamin Lévêque, 2016, ArXiv.

Detecting induced subgraphs

Benjamin Lévêque, Frédéric Maffray, Nicolas Trotignon, 2007 .

On graphs with no induced subdivision of K4

Nicolas Trotignon, Benjamin Lévêque, Frédéric Maffray, 2012, J. Comb. Theory, Ser. B.

Triangle Contact Representations and Duality

Benjamin Lévêque, Alexandre Pinlou, Daniel Gonçalves, 2010, Discrete & Computational Geometry.

Contracting Graphs to Paths and Trees

Pim van 't Hof, Pinar Heggernes, Christophe Paul, 2011, Algorithmica.

Coloring Artemis graphs

Bruce A. Reed, Nicolas Trotignon, Benjamin Lévêque, 2005, Theor. Comput. Sci..

Detecting induced subgraphs pdf

Nicolas Trotignon, Benjamin Lévêque, Frédéric Maffray, 2007, Discret. Appl. Math..

HABILITATION A DIRIGER DES RECHERCHES

LA Guyane, J. Roggy, Benjamin Lévêque, 2017 .

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

Benjamin Lévêque, Éric Fusy, Éric Fusy, 2018, J. Comb. Theory, Ser. A.

A bijection for essentially 4-connected toroidal triangulations pdf

Nicolas Bonichon, Benjamin Lévêque, Nicolas Bonichon, 2017, Electron. J. Comb..

Encoding Toroidal Triangulations

Benjamin Lévêque, Daniel Gonçalves, Vincent Despré, 2015, Discrete & Computational Geometry.

On the structure of Schnyder woods on orientable surfaces

Benjamin Lévêque, Kolja B. Knauer, Daniel Gonçalves, 2015, J. Comput. Geom..

Structure of Schnyder labelings on orientable surfaces pdf

Benjamin Lévêque, Kolja B. Knauer, Daniel Gonçalves, 2015, ArXiv.

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

Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou, 2014, Discret. Math..

List coloring the square of sparse graphs with large degree

Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou, 2013, Eur. J. Comb..

2‐Distance Coloring of Sparse Graphs

Benjamin Lévêque, Marthe Bonamy, Alexandre Pinlou, 2011, J. Graph Theory.