Title : ( On non-traceable 3-connected planar cubic graphs of minimum order )
Authors: gholamreza abrishamimoghadam , Freydoon Rahbarnia , Nico Van Cleemput ,
دانلود فایل برای اعضای دانشگاهAccess to full-text not allowed by authors
Abstract
In 1980, Zamfirescu presented a non-traceable (i.e. without a hamiltonian path) 3- connected planar cubic graph with 88 vertices, which is still the smallest known one of its kind. In this note we present several new examples with 88 vertices. Moreover, we present a non-traceable cyclically 4-connected planar cubic graph with 168 vertices.
Keywords
, Non, traceable Hamiltonian path Polyhedron Cubic graph 3, connected Planar
@article{paperid:1106380,
author = {Abrishamimoghadam, Gholamreza and Rahbarnia, Freydoon and نیکو کلیمپوت},
title = {On non-traceable 3-connected planar cubic graphs of minimum order},
journal = {Discrete Mathematics},
year = {2026},
volume = {349},
number = {6},
month = {June},
issn = {0012-365X},
pages = {114983--114983},
numpages = {0},
keywords = {Non-traceable
Hamiltonian path
Polyhedron
Cubic graph
3-connected
Planar},
}
%0 Journal Article
%T On non-traceable 3-connected planar cubic graphs of minimum order
%A Abrishamimoghadam, Gholamreza
%A Rahbarnia, Freydoon
%A نیکو کلیمپوت
%J Discrete Mathematics
%@ 0012-365X
%D 2026
