The following pages link to Benjamin Lévêque (Q393357):
Displaying 37 items.
- Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable (Q393358) (← links)
- Coloring vertices of a graph or finding a Meyniel obstruction (Q418741) (← links)
- Triangle contact representations and duality (Q443911) (← links)
- On graphs with no induced subdivision of \(K_4\) (Q444381) (← links)
- Encoding toroidal triangulations (Q527433) (← links)
- A bijection for essentially 4-connected toroidal triangulations (Q668063) (← links)
- List coloring the square of sparse graphs with large degree (Q740267) (← links)
- Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth (Q778701) (← links)
- Asteroidal quadruples in non rooted path graphs (Q891307) (← links)
- Precoloring extension of co-Meyniel graphs (Q995757) (← links)
- Coloring Artemis graphs (Q1019741) (← links)
- A bijection for essentially 3-connected toroidal maps (Q2033922) (← links)
- Local certification of graphs on surfaces (Q2078616) (← links)
- Toroidal maps: Schnyder woods, orthogonal surfaces and straight-line representations (Q2441580) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- Planar graphs with $\Delta\geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable (Q2808541) (← links)
- Asteroids in rooted and directed path graphs (Q2839213) (← links)
- (Q2857337) (← links)
- Regularized path integrals and anomalies: U(1) chiral gauge theory (Q2861730) (← links)
- 2-Distance Coloring of Sparse Graphs (Q2930038) (← links)
- From Path Graphs to Directed Path Graphs (Q3057630) (← links)
- Triangle Contact Representations and Duality (Q3073678) (← links)
- Characterizing directed path graphs by forbidden asteroids (Q3174239) (← links)
- Coloring Meyniel graphs in linear time (Q3439304) (← links)
- Optimizing diversity (Q3503453) (← links)
- Generating All Sets With Bounded Unions (Q3529508) (← links)
- Coloring Bull-Free Perfectly Contractile Graphs (Q3544248) (← links)
- Characterizing path graphs by forbidden induced subgraphs (Q3652563) (← links)
- On the structure of Schnyder woods on orientable surfaces (Q5224477) (← links)
- Homothetic triangle representations of planar graphs (Q5240366) (← links)
- Graph transformations preserving the stability number (Q5891088) (← links)
- Contracting chordal graphs and bipartite graphs to paths and trees (Q5891098) (← links)
- Detecting induced subgraphs (Q5900072) (← links)
- Graph transformations preserving the stability number (Q5916099) (← links)
- Contracting chordal graphs and bipartite graphs to paths and trees (Q5920327) (← links)
- Locating-dominating sets in local tournaments (Q6162022) (← links)
- Reconfiguration of digraph homomorphisms (Q6615152) (← links)
