2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/71918We 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 figuresCombinatorics05C38text