Article ID Journal Published Year Pages File Type
4651055 Discrete Mathematics 2007 10 Pages PDF
Abstract

We determine the smallest claw-free, 2-connected, nontraceable graphs and use one of these graphs to construct a new family of 2-connected, claw-free, maximal nontraceable graphs.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs
Authors
, , ,