New sufficient condition for Hamiltonian paths
This paper proves a sufficient condition for the existence of Hamiltonian paths in simple connected graphs. This condition was conjectured in 2006 by a computer program named Graffiti.pc. Given examples will show that this new condition detects Hamiltonian paths that a theorem by Chvatal does not. A...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1911/22232 |