Benjamin Lévêque
According to our database1,
Benjamin Lévêque
authored at least 42 papers
between 2005 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023
2022
2021
2020
Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth.
J. Comb. Theory A, 2020
2019
Electron. J. Comb., 2019
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
2015
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
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
Theor. Comput. Sci., 2012
2011
Electron. Notes Discret. Math., 2011
2010
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010
2009
Electron. Notes Discret. Math., 2009
2008
J. Interconnect. Networks, 2008
2007
Coloration de graphes : structures et algorithmes. (Coloring graphs : structures and algorithms).
PhD thesis, 2007
2005