Cubic planar hamiltonian graphs of various types

Abstract

Let U be the set of cubic planar hamiltonian graphs, A the set of graphs G in U such thatG− v is hamiltonian for any vertex v of G, B the set of graphs G in U such thatG− e is hamiltonian for any edge e of G, and C the set of graphs G in U such that there is a hamiltonian path between any two different vertices of G. With the inclusion and/or exclusion of… (More)
DOI: 10.1016/j.disc.2005.08.011

Topics

9 Figures and Tables

Slides referencing similar topics