Benjamin Lévêque

From MaRDI portal
Person:393357

Available identifiers

zbMath Open leveque.benjaminMaRDI QIDQ393357

List of research outcomes





PublicationDate of PublicationType
Reconfiguration of digraph homomorphisms2024-10-08Paper
Locating-dominating sets in local tournaments2023-06-15Paper
Reconfiguration of Digraph Homomorphisms2022-05-18Paper
Local certification of graphs on surfaces2022-03-01Paper
A bijection for essentially 3-connected toroidal maps2021-06-18Paper
Local certification of graphs on surfaces2021-02-08Paper
Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth2020-07-03Paper
Homothetic triangle representations of planar graphs2019-10-25Paper
On the structure of Schnyder woods on orientable surfaces2019-07-23Paper
Scaling limits for random triangulations on the torus2019-05-06Paper
A bijection for essentially 4-connected toroidal triangulations2019-03-05Paper
Encoding toroidal triangulations2017-05-11Paper
Generalization of Schnyder woods to orientable surfaces and applications2017-02-24Paper
Planar graphs with \(\Delta \geq 7\) and no triangle adjacent to a \(C_{4}\) are minimally edge and total choosable2016-05-24Paper
Asteroidal quadruples in non rooted path graphs2015-11-17Paper
2-Distance Coloring of Sparse Graphs2014-11-17Paper
2-distance coloring of sparse graphs2014-11-17Paper
List coloring the square of sparse graphs with large degree2014-09-02Paper
Contracting chordal graphs and bipartite graphs to paths and trees2014-05-05Paper
Contracting graphs to paths and trees2014-03-25Paper
Toroidal maps: Schnyder woods, orthogonal surfaces and straight-line representations2014-03-25Paper
Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable2014-01-17Paper
Regularized path integrals and anomalies: U(1) chiral gauge theory2013-11-11Paper
2-distance coloring of sparse graphs2013-11-01Paper
Contracting chordal graphs and bipartite graphs to paths and trees2013-07-23Paper
Graph transformations preserving the stability number2013-07-19Paper
Asteroids in rooted and directed path graphs2013-07-04Paper
Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable2013-01-29Paper
Graph transformations preserving the stability number2012-11-22Paper
On graphs with no induced subdivision of \(K_4\)2012-08-14Paper
Triangle contact representations and duality2012-08-13Paper
Contracting graphs to paths and trees2012-06-15Paper
Coloring vertices of a graph or finding a Meyniel obstruction2012-05-30Paper
Characterizing directed path graphs by forbidden asteroids2011-10-12Paper
Triangle Contact Representations and Duality2011-02-11Paper
From Path Graphs to Directed Path Graphs2010-11-16Paper
Detecting induced subgraphs2010-04-28Paper
Characterizing path graphs by forbidden induced subgraphs2009-12-18Paper
Coloring Artemis graphs2009-05-28Paper
Coloring Bull-Free Perfectly Contractile Graphs2008-12-05Paper
Generating All Sets With Bounded Unions2008-10-13Paper
Detecting induced subgraphs2008-06-05Paper
Optimizing diversity2008-06-05Paper
Precoloring extension of co-Meyniel graphs2007-09-10Paper
Coloring Meyniel graphs in linear time2007-05-29Paper
Erratum : MCColor is not optimal on Meyniel graphs2004-05-17Paper

Research outcomes over time

This page was built for person: Benjamin Lévêque