Extending Kotzig's Theorem: Hensley's Lattice Polytope Theorem

Research output: Contribution to journalArticlepeer-review


The weight w(E) of an edge E in a graph G is defined as the sum of the valences of the end-points of E. The weight w(G) of the graph G is defined by w(G) =min{w(E)çEç G}. Kotzig proved that w(G) ≤ 13 holds for all planar graphs, and Grünbaum and Shephard proved that w(G) ≤ 15 holds for all toroidal graphs.

Original languageEnglish
Pages (from-to)307-310
Number of pages4
JournalNorth-Holland Mathematics Studies
Issue numberC
StatePublished - 1 Jan 1984

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'Extending Kotzig's Theorem: Hensley's Lattice Polytope Theorem'. Together they form a unique fingerprint.

Cite this