Non-hamiltonian cubic planar graphs having just two types of faces

Research output: Contribution to journalArticlepeer-review


This chapter discusses the non-Hamiltonian cubic planar graphs having two types of faces. It is assumed that G(m, n) denote the family of all the cubic, 3-connected planar graphs having just two types of faces, m-gons and n-gons. All the members of G(3, 6) were described by Grünbaum and Motzkin. Goodey proved, in relation to Barnette's Conjecture, that all the members of G(4, 6) are Hamiltonian. All the members of G(m, n) are Hamiltonian. For every k, k ≥ 11, G(5, k) contains non-Hamiltonian members.

Original languageEnglish
Pages (from-to)225-227
Number of pages3
JournalAnnals of Discrete Mathematics
Issue numberC
StatePublished - 1 Jan 1980

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Non-hamiltonian cubic planar graphs having just two types of faces'. Together they form a unique fingerprint.

Cite this