Maximal nontraceable graphs
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...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10500/1684 |