On eliminating square paths in a square lattice

Simple item page
dc.contributor.advisorDean, Nathaniel
dc.creatorWilliams, Nikki LaTrina
dc.date.accessioned2009-06-04T06:34:59Z
dc.date.available2009-06-04T06:34:59Z
dc.date.issued2000
dc.description.abstractRemoving the minimum number of vertices or points from a square lattice such that no square path exists is known as the square path problem. Finding this number as the size of the lattice increases is not so trivial. Results provided by Erdos-Posa and Bienstock-Dean provides an upper bound for eliminating all cycles from a planar graph but sheds little light on the case of the square lattice. This paper provides several values for the minimum number of vertices needed to be removed such that no square path exists.
dc.format.extent41 p.en_US
dc.format.mimetypeapplication/pdf
dc.identifier.callnoTHESIS MATH.SCI. 2000 WILLIAMS
dc.identifier.citationWilliams, Nikki LaTrina. "On eliminating square paths in a square lattice." (2000) Master’s Thesis, Rice University. <a href="https://hdl.handle.net/1911/17386">https://hdl.handle.net/1911/17386</a>.
dc.identifier.urihttps://hdl.handle.net/1911/17386
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.subjectOperations research
dc.subjectComputer science
dc.titleOn eliminating square paths in a square lattice
dc.typeThesis
dc.type.materialText
thesis.degree.departmentMathematical Sciences
thesis.degree.disciplineEngineering
thesis.degree.grantorRice University
thesis.degree.levelMasters
thesis.degree.nameMaster of Arts
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
1399313.PDF
Size:
943.58 KB
Format:
Adobe Portable Document Format
Download
Collections
Rice University Electronic Theses and Dissertations