Cubic maximal nontraceable graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
9 pages, 6 figures

Keywords

Combinatorics, 05C38

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/71918

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0407290
 http://arxiv.org/abs/math/0407290

Collections

arXiv