A note on the smallest connected non-traceable cubic bipartite planar graph

Gholamreza Abrishami,Freydoon Rahbarnia

A note on the smallest connected non-traceable cubic bipartite planar graph

2019

Gholamreza Abrishami
Freydoon Rahbarnia

Abstract A graph is traceable if it contains a Hamiltonian path. We present a connected non-traceable cubic bipartite planar graph with 52 vertices and prove that there are no smaller such graphs.

Keywords:

Hamiltonian path
Cubic graph
Combinatorics
Discrete mathematics
Bipartite graph
Planar graph
Mathematics
Vertex (geometry)
Graph

Correction
Source
Cite
Save
Machine Reading By IdeaReader

References

Citations