New sufficient condition for Hamiltonian paths

Simple item page
dc.contributor.advisorDamanik, Daviden_US
dc.creatorJennings, Landonen_US
dc.date.accessioned2009-06-03T19:55:37Zen_US
dc.date.available2009-06-03T19:55:37Zen_US
dc.date.issued2008en_US
dc.description.abstractThis 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 second condition conjectured by Graffiti.pc is shown to satisfy Chvatal's condition. Thus this second conjecture, while true, does not improve on known results.en_US
dc.format.extent39 p.en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.callnoTHESIS MATH. 2008 JENNINGSen_US
dc.identifier.citationJennings, Landon. "New sufficient condition for Hamiltonian paths." (2008) Diss., Rice University. <a href="https://hdl.handle.net/1911/22232">https://hdl.handle.net/1911/22232</a>.en_US
dc.identifier.urihttps://hdl.handle.net/1911/22232en_US
dc.language.isoengen_US
dc.rightsCopyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.en_US
dc.subjectMathematicsen_US
dc.titleNew sufficient condition for Hamiltonian pathsen_US
dc.typeThesisen_US
dc.type.materialTexten_US
thesis.degree.departmentMathematicsen_US
thesis.degree.disciplineNatural Sciencesen_US
thesis.degree.grantorRice Universityen_US
thesis.degree.levelDoctoralen_US
thesis.degree.nameDoctor of Philosophyen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
3309890.PDF
Size:
1.56 MB
Format:
Adobe Portable Document Format
Download
Collections
Rice University Theses and Dissertations