Hamiltonian cycles in annular decomposable Barnette graphs

  title={Hamiltonian cycles in annular decomposable Barnette graphs},
  author={Saptarshi Bej},
  journal={Journal of Discrete Mathematical Sciences and Cryptography},
  • Saptarshi Bej
  • Published 15 August 2020
  • Mathematics
  • Journal of Discrete Mathematical Sciences and Cryptography
Barnette's conjecture is an unsolved problem in graph theory. The problem states that every 3-regular (cubic), 3-connected, planar, bipartite (Barnette) graph is Hamiltonian. Partial results have been derived with restrictions on number of vertices, several properties of face-partitions and dual graphs of Barnette graphs while some studies focus just on structural characterizations of Barnette graphs. Noting that Spider web graphs are a subclass of Annular Decomposable Barnette (ADB graphs… 

Figures from this paper

A note on Barnette's conjecture

Hamiltonian cycles in planar cubic graphs with facial 2‐factors, and a new partial solution of Barnette's Conjecture

This and other results of this paper establish partial solutions of Barnette's Conjecture according to which every 3‐connected cubic planar bipartite graph is hamiltonian.

On Barnette's conjecture

Remarks on Barnette’s conjecture

It is shown that P has at least 3 2 | P* | Δ 2 ( P ∗ ) different Hamilton cycles.

Spider web networks: a family of optimal, fault tolerant, hamiltonian bipartite graphs

The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices

Generalization of bipartite graphs

Abstract Let G = (V, E) be a graph with set of vertices V and set of edges E. An independent set in G is a subset S of V such that no two vertices of S are mutually adjacent. E. Sampathkumar et al.

Annular and pants thrackles

The Thrackle Conjecture is proved for thrackle drawings all of whose vertices lie on the boundaries of connected domains in the complement of the drawing.

On Barnette’s conjecture and the $$H^{+-}$$H+- property

Let $$\mathcal{B}$$B denote the class of all 3-connected cubic bipartite plane graphs. A conjecture of Barnette states that every graph in $$\mathcal{B}$$B has a Hamilton cycle. A cyclic sequence of