Title : ( A note on the smallest connected non-traceable cubic bipartite planar graph )
Authors: gholamreza abrishamimoghadam , Freydoon Rahbarnia ,
دانلود فایل برای اعضای دانشگاهAccess to full-text not allowed by authors
Abstract
A graph is traceable if it contains a Hamiltonian path. We present a connected nontraceable cubic bipartite planar graph with 52 vertices and prove that there are no smaller such graphs.
Keywords
, Hamiltonian path, Cubic graph, Planar graph, Bipartite graph.
@article{paperid:1074478,
author = {Abrishamimoghadam, Gholamreza and Rahbarnia, Freydoon},
title = {A note on the smallest connected non-traceable cubic bipartite planar graph},
journal = {Discrete Mathematics},
year = {2019},
volume = {342},
number = {8},
month = {August},
issn = {0012-365X},
pages = {2384--2392},
numpages = {8},
keywords = {Hamiltonian path; Cubic graph; Planar graph; Bipartite graph.},
}
%0 Journal Article
%T A note on the smallest connected non-traceable cubic bipartite planar graph
%A Abrishamimoghadam, Gholamreza
%A Rahbarnia, Freydoon
%J Discrete Mathematics
%@ 0012-365X
%D 2019
