|
Counting edge-transitive, one-ended, three-connected planar maps with a given growth rate
Tomaž Pisanski
Ars mathematica contemporanea
Volume 2,
Number 2,
,
2009.
ISSN 1855-3966
AbstractB. Grünbaum and G. C. Shephard have classified one-ended, 3-connected, planar, edgetransitive
maps. It turns out that each of these maps can be described uniquely by an edgesymbol
hp; q; k; `i. Recently the growth rate of each of these maps has been determined
by S. Graves, T. Pisanski and M. E. Watkins. We determine the number of edge-transitive
maps for a given growth rate. | EPrint Type: | Article |
|---|
| Project Keyword: | Project Keyword UNSPECIFIED |
|---|
| Subjects: | Theory & Algorithms |
|---|
| ID Code: | 8269 |
|---|
| Deposited By: | Boris Horvat |
|---|
| Deposited On: | 21 February 2012 |
|---|
[Edit]
|
