Structural and computational results on platypus graphs

Jan Goedgebeur, Addie Neyt and Carol T. Zamfirescu

Applied Mathematics and Computation, 2020, vol. 386, issue C

Abstract: A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions regarding longest paths and longest cycles, for instance hypohamiltonian, leaf-stable, and maximally non-hamiltonian graphs.

Keywords: Non-hamiltonian; Traceable; Hypohamiltonian; Hypotraceable; Cubic graph; Girth; Maximally non-hamiltonian graph; Computations (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320304495
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:386:y:2020:i:c:s0096300320304495

DOI: 10.1016/j.amc.2020.125491

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().