Title of article
Cubic maximal nontraceable graphs Original Research Article
Author/Authors
Vladimir Nikiforov، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
7
From page
885
To page
891
Abstract
We determine a lower bound for the number of edges of a 2-connected maximal nontraceable graph, and present a construction of an infinite family of maximal nontraceable graphs that realize this bound.
Keywords
Hamiltonian path , Maximal nonhamiltonian , Hamiltonian , Hamiltonian cycle , Nontraceable , Maximal hypohamiltonian , Traceable , Hypohamiltonian , Maximal nontraceable , Nonhamiltonian
Journal title
Discrete Mathematics
Serial Year
2007
Journal title
Discrete Mathematics
Record number
947727
Link To Document