New sufficient condition for Hamiltonian paths

Simple item page
dc.contributor.advisorDamanik, David
dc.creatorJennings, Landon
dc.date.accessioned2009-06-03T19:55:37Z
dc.date.available2009-06-03T19:55:37Z
dc.date.issued2008
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.
dc.format.extent39 p.en_US
dc.format.mimetypeapplication/pdf
dc.identifier.callnoTHESIS MATH. 2008 JENNINGS
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>.
dc.identifier.urihttps://hdl.handle.net/1911/22232
dc.language.isoeng
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.
dc.subjectMathematics
dc.titleNew sufficient condition for Hamiltonian paths
dc.typeThesis
dc.type.materialText
thesis.degree.departmentMathematics
thesis.degree.disciplineNatural Sciences
thesis.degree.grantorRice University
thesis.degree.levelDoctoral
thesis.degree.nameDoctor of Philosophy
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 Electronic Theses and Dissertations