Geodesic
Edge-bandwidth of the triangular grid
The electronic journal of combinatorics, Tome 14 (2007)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
In 1995, Hochberg, McDiarmid, and Saks proved that the vertex-bandwidth of the triangular grid $T_n$ is precisely $n+1$; more recently Balogh, Mubayi, and Pluhár posed the problem of determining the edge-bandwidth of $T_n$. We show that the edge-bandwidth of $T_n$ is bounded above by $3n-1$ and below by $3n-o(n)$.
DOI : 10.37236/985
Classification : 05C78
Mots-clés : vertex bandwidth, edge bandwidth, triangular grid 
Reza Akhtar; Tao Jiang; Dan Pritikin. Edge-bandwidth of the triangular grid. The electronic journal of combinatorics, Tome 14 (2007). doi: 10.37236/985
@article{10_37236_985,
     author = {Reza Akhtar and Tao Jiang and Dan Pritikin},
     title = {Edge-bandwidth of the triangular grid},
     journal = {The electronic journal of combinatorics},
     year = {2007},
     volume = {14},
     doi = {10.37236/985},
     zbl = {1158.05334},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/985/}
}
TY  - JOUR
AU  - Reza Akhtar
AU  - Tao Jiang
AU  - Dan Pritikin
TI  - Edge-bandwidth of the triangular grid
JO  - The electronic journal of combinatorics
PY  - 2007
VL  - 14
UR  - http://geodesic.mathdoc.fr/articles/10.37236/985/
DO  - 10.37236/985
ID  - 10_37236_985
ER  - 
%0 Journal Article
%A Reza Akhtar
%A Tao Jiang
%A Dan Pritikin
%T Edge-bandwidth of the triangular grid
%J The electronic journal of combinatorics
%D 2007
%V 14
%U http://geodesic.mathdoc.fr/articles/10.37236/985/
%R 10.37236/985
%F 10_37236_985

Cité par Sources :