<abstract xmlns="http://www.w3.org/1999/xhtml"><p>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.</p></abstract>

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.

Construction of Barnette graphs whose large subgraphs are non-Hamiltonian

Acta Universitatis Sapientiae, Mathematica

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

{"article-title":"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...

Construction of Barnette graphs whose large subgraphs are non-Hamiltonian

Data publikacji: 27 lut 2020

Zakres stron: 363 - 370

Otrzymano: 06 maj 2019

DOI: https://doi.org/10.2478/ausm-2019-0026

Słowa kluczowe
cubic graph, Hamiltonian graph, planar graph, Barnette graph

© 2019 S. Pirzada et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Construction of Barnette graphs whose large subgraphs are non-Hamiltonian

Data publikacji: 27 lut 2020

Zakres stron: 363 - 370

Otrzymano: 06 maj 2019

DOI: https://doi.org/10.2478/ausm-2019-0026

Słowa kluczowecubic graph, Hamiltonian graph, planar graph, Barnette graph

© 2019 S. Pirzada et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Słowa kluczowe
cubic graph, Hamiltonian graph, planar graph, Barnette graph