Non-Hamiltonian non-Grinbergian graphs

Research output: Contribution to journalArticlepeer-review


Settling a question of Tutte and a similar question of Grünbaum and Zaks, we present a 3-valent 3-connected planar graph that has only pentagons and octagons, has 92 (200, respectively) vertices and its longest circuit (path, respectively) contains at most 90 (198, respectively) vertices; moreover, it is shown that the family of all 3-valent 3-connected planar graphs, having n-gons only if n≡ 2 (mod3) (or n≡ 1 (mod3)), has a shortness exponent which is less than one.

Original languageEnglish
Pages (from-to)317-321
Number of pages5
JournalDiscrete Mathematics
Issue number3
StatePublished - 1977

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Non-Hamiltonian non-Grinbergian graphs'. Together they form a unique fingerprint.

Cite this