One document found

Article / Chapter
All rights reserved
2016-02

Thoughts on Barnette's conjecture

We prove a new sufficient condition for a cubic 3-connected planar graph to be Hamiltonian. This condition is most easily described as a property of the dual graph. Let G be a planar triangulation. Then the dual G∗ is a cubic 3-connected planar graph, and G∗ is bipartite if and only if G is Eulerian....
Ilmenau: ilmedia, 2016-02