Construction of Barnette graphs whose large subgraphs are non-Hamiltonian

Barnette’s conjecture states that every three connected cubic bipartite planar graph (CPB3C) is Hamiltonian. In this paper we show the existence of a family of CPB3C Hamiltonian graphs in which large and large subgraphs are non-Hamiltonian.

Bibliographic Details
Main Authors: Pirzada S., Shah Mushtaq A.
Format: Article
Language:English
Published: Sciendo 2019-12-01
Series:Acta Universitatis Sapientiae: Mathematica
Subjects:
Online Access:https://doi.org/10.2478/ausm-2019-0026
Description
Summary:Barnette’s conjecture states that every three connected cubic bipartite planar graph (CPB3C) is Hamiltonian. In this paper we show the existence of a family of CPB3C Hamiltonian graphs in which large and large subgraphs are non-Hamiltonian.
ISSN:2066-7752