Maximal nontraceable graphs

Maximal nontraceable graphs

Show other versions (1)

A graph G is maximal nontraceable (MNT) (maximal nonhamiltonian (MNH)) if G is not traceable (hamiltonian), i.e. does not contain a hamiltonian path (cycle), but G+xy is traceable (hamiltonian) for all nonadjacent vertices x and y in G. A graph G is hypohamiltonian if G is not hamiltonian, but every...

Full description

Bibliographic Details
Main Author: Singleton, Joy Elizabeth
Other Authors: Bullock, F.E.S. (Dr.)
Language:en
Published: 2009
Subjects:
graph theory
hamiltonian path
traceable
nontraceable
maximal nontraceable
hamiltonian cycle
hamiltonian
nonhamiltonian
maximal nonhamiltonian
hypohamiltonian
maximal hypohamiltonian
hamiltonian-connected
maximal nonhamiltonian-connected
Online Access:Singleton, Joy Elizabeth (2009) Maximal nontraceable graphs, University of South Africa, Pretoria, <http://hdl.handle.net/10500/1684>
http://hdl.handle.net/10500/1684

Internet

Singleton, Joy Elizabeth (2009) Maximal nontraceable graphs, University of South Africa, Pretoria, <http://hdl.handle.net/10500/1684>
http://hdl.handle.net/10500/1684

Similar Items