Geodesic
A lower bound on the diameter of the flip graph
The electronic journal of combinatorics, Tome 24 (2017) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

The flip graph is the graph whose vertices correspond to non-isomorphic combinatorial triangulations and whose edges connect pairs of triangulations that can be obtained from one another by flipping a single edge. In this note we show that the diameter of the flip graph is at least $\frac{7n}{3} + \Theta(1)$, improving upon the previous $2n + \Theta(1)$ lower bound.
DOI : 10.37236/5489
Classification : 05C12, 05C10
Mots-clés : planar graphs, triangulations, flips 
@article{10_37236_5489,
     author = {Fabrizio Frati},
     title = {A lower bound on the diameter of the flip graph},
     journal = {The electronic journal of combinatorics},
     year = {2017},
     volume = {24},
     number = {1},
     doi = {10.37236/5489},
     zbl = {1358.05086},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/5489/}
}
TY  - JOUR
AU  - Fabrizio Frati
TI  - A lower bound on the diameter of the flip graph
JO  - The electronic journal of combinatorics
PY  - 2017
VL  - 24
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/5489/
DO  - 10.37236/5489
ID  - 10_37236_5489
ER  - 
%0 Journal Article
%A Fabrizio Frati
%T A lower bound on the diameter of the flip graph
%J The electronic journal of combinatorics
%D 2017
%V 24
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/5489/
%R 10.37236/5489
%F 10_37236_5489
Fabrizio Frati. A lower bound on the diameter of the flip graph. The electronic journal of combinatorics, Tome 24 (2017) no. 1. doi: 10.37236/5489

Cité par Sources :