|
|||||
|
|
A note on the smallest connected non-traceable cubic bipartite planar graph |
|
| Authors: | 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: | Corresponding author Hamiltonian path Cubic graph Planar graph Bipartite graph |
| 本文献已被 ScienceDirect 等数据库收录！ | |