Cubic maximal nontraceable graphs
Combinatorics
2007-05-23 v1
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
Cite
@article{arxiv.math/0407290,
title = {Cubic maximal nontraceable graphs},
author = {Marietjie Frick and Joy Singleton},
journal= {arXiv preprint arXiv:math/0407290},
year = {2007}
}
Comments
9 pages, 6 figures