|
|||||
|
|
Longest cycles in polyhedral graphs |
|
| Authors: | Hansjoachim Walther |
| Affiliation: | (1) Department of Mathematics, University of Technology Ilmenau, 0-630 Ilmenau, Germany |
| Abstract: | A sequence of polyhedral graphsG n is constructed, having only 3-valent and 8-valent vertices and having only 3-gons and 8-gons as faces with the property that the shortness exponent of the sequence as well as the shortness exponent of the sequence of duals is smaller than one. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |