Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Hamiltonian cubic bipartite graphs

Misa Nakanishi

Abstract

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

Hamiltonian cubic bipartite graphs

Abstract

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

Paper Structure

This paper contains 4 sections, 3 theorems, 2 equations.

Table of Contents

  1. Introduction
  2. Contribution
  3. Notation and property
  4. Hamiltonian cubic bipartite graphs

Key Result

Proposition 1

Every bridgeless cubic graph has a perfect matching. (Note that the complement of a perfect matching is always a 2-factor.)

Theorems & Definitions (9)

  • Proposition 1: Petersen
  • proof
  • proof
  • Lemma 4.1
  • proof
  • Claim 4.1
  • proof
  • Theorem 4.1
  • proof