Cubic maximal nontraceable graphs

Simple item page
dc.creatorFrick, Marietjie
dc.creatorSingleton, Joy
dc.date2004-07-16
dc.date.accessioned2026-07-07T05:10:24Z
dc.date.available2026-07-07T05:10:24Z
dc.descriptionWe 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.
dc.description9 pages, 6 figures
dc.identifierhttps://arxiv.org/abs/math/0407290
dc.identifierhttp://arxiv.org/abs/math/0407290
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/71918
dc.subjectCombinatorics
dc.subject05C38
dc.titleCubic maximal nontraceable graphs
dc.typetext

Files

Collections

arXiv