Construction of Barnette graphs whose large subgraphs are non-Hamiltonian
y | 27 feb 2020
Acerca de este artículo
Publicado en línea: 27 feb 2020
Páginas: 363 - 370
Recibido: 06 may 2019
DOI: https://doi.org/10.2478/ausm-2019-0026
Palabras clave
© 2019 S. Pirzada et al., published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.
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.