Zobrazeno 1 - 10
of 81
pro vyhledávání: '"LEVEQUE, BENJAMIN"'
For a fixed graph H, the H-Recoloring problem asks whether for two given homomorphisms from a graph G to H, we can transform one into the other by changing the image of a single vertex of G in each step and maintaining a homomorphism from G to H thro
Externí odkaz:
http://arxiv.org/abs/2205.09210
A dominating set in a directed graph is a set of vertices $S$ such that all the vertices that do not belong to $S$ have an in-neighbour in $S$. A locating set $S$ is a set of vertices such that all the vertices that do not belong to $S$ are character
Externí odkaz:
http://arxiv.org/abs/2109.03102
Autor:
Esperet, Louis, Lévêque, Benjamin
Publikováno v:
Theoretical Computer Science 909 (2022), 68-75
A proof labelling scheme for a graph class $\mathcal{C}$ is an assignment of certificates to the vertices of any graph in the class $\mathcal{C}$, such that upon reading its certificate and the certificates of its neighbors, every vertex from a graph
Externí odkaz:
http://arxiv.org/abs/2102.04133
Publikováno v:
In Discrete Applied Mathematics 15 October 2023 337:14-24
We prove that every planar graph is the intersection graph of homothetic triangles in the plane.
Comment: 6 pages
Comment: 6 pages
Externí odkaz:
http://arxiv.org/abs/1908.11749
We present a bijection for toroidal maps that are essentially $3$-connected ($3$-connected in the periodic planar representation). Our construction actually proceeds on certain closely related bipartite toroidal maps with all faces of degree $4$ exce
Externí odkaz:
http://arxiv.org/abs/1907.04016
We study the scaling limit of essentially simple triangulations on the torus. We consider, for every $n\geq 1$, a uniformly random triangulation $G_n$ over the set of (appropriately rooted) essentially simple triangulations on the torus with $n$ vert
Externí odkaz:
http://arxiv.org/abs/1905.01873
Autor:
Fusy, Éric, Lévêque, Benjamin
We present unified bijections for maps on the torus with control on the face-degrees and essential girth (girth of the periodic planar representation). A first step is to show that for d>=3 every toroidal d-angulation of essential girth d can be endo
Externí odkaz:
http://arxiv.org/abs/1807.00522
Autor:
Bonichon, Nicolas, Lévêque, Benjamin
Transversal structures (also known as regular edge labelings) are combinatorial structures defined over 4-connected plane triangulations with quadrangular outer-face. They have been intensively studied and used for many applications (drawing algorith
Externí odkaz:
http://arxiv.org/abs/1707.08191
Autor:
Lévêque, Benjamin
Schnyder woods are particularly elegant combinatorial structures with numerous applications concerning planar triangulations and more generally 3-connected planar maps. We propose a simple generalization of Schnyder woods from the plane to maps on or
Externí odkaz:
http://arxiv.org/abs/1702.07589