# Hamiltonian cubic bipartite graphs

## TL;DR

This paper presents a polynomial time algorithm to determine whether a cubic bipartite graph contains a Hamilton cycle, addressing a fundamental problem in graph theory.

## Contribution

The paper introduces the first polynomial time algorithm for detecting Hamilton cycles specifically in cubic bipartite graphs.

## Key findings

- Algorithm successfully identifies Hamilton cycles in cubic bipartite graphs
- Complexity of the problem is reduced to polynomial time for this class
- Provides a new tool for analyzing Hamiltonicity in specific graph classes

## Abstract

We provide a polynomial time algorithm to determine a cubic bipartite graph has a hamilton cycle or not.