| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651149 | Discrete Mathematics | 2007 | 7 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Marietjie Frick, Joy Singleton,