33 search results - page 1 / 7 » Edge-Bandwidth of the Triangular Grid |
COMBINATORICS
2007
13 years 5 months ago
2007
In 1995, Hochberg, McDiarmid, and Saks proved that the vertex-bandwidth of the triangular grid Tn is precisely n + 1; more recently Balogh, Mubayi, and Pluh´ar posed the problem ...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We examine online grid covering with hexagonal and triangular grids. For arbitrary environments without obstacles we provide a strategy that produces tours of length S C + 1 4 E ...
SIAMDM
2008
13 years 5 months ago
2008
CCCG
2006
13 years 6 months ago
2006
We study the Hamiltonian Cycle problem in graphs induced by subsets of the vertices of the tiling of the plane with equilateral triangles. By analogy with grid graphs we call such...
DM
2008
13 years 5 months ago
2008
A triangular grid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. In 2000, Reay and Zamfirescu showed that all 2-conne...