Non-hamiltonian simple planar graphs

Research output: Contribution to journalArticlepeer-review


The purpose of this paper is to present various results on the said topic, some of which were announced in [24] while others extend earlier results [22, 23] of the author. In Section 1 we present non-Hamiltonian simple 3-connected planar graph in which the largest face is a 7-gon; Section 2 extends earlier results on non-Hamiltonian simple 3-connected planar graphs in which there are only two types of faces; Section 3 deals with a curious property of a family of some simple 3-connected planar graphs having only quadrangles and hexagons; we finish by two short remarks, one on a theorem of A. Kotzig and another on covering graphs by their Hamiltonian circuits.

Original languageEnglish
Pages (from-to)255-263
Number of pages9
JournalNorth-Holland Mathematics Studies
Issue numberC
StatePublished - 1 Jan 1982

ASJC Scopus subject areas

  • Mathematics (all)


Dive into the research topics of 'Non-hamiltonian simple planar graphs'. Together they form a unique fingerprint.

Cite this