On characterizing graphs with branchwidth at most four

Simple item page
dc.contributor.advisorDean, Nathaniel
dc.creatorRiggins, Kymberly Dawn
dc.date.accessioned2009-06-04T08:09:06Z
dc.date.available2009-06-04T08:09:06Z
dc.date.issued2001
dc.description.abstractThere are several ways in which we can characterize classes of graphs. One such way of classifying graphs is by their branchwidth. In working to characterize the class of graphs with branchwidth at most four beta 4 we have found a set of reductions that reduces members of beta 4 to the zero graph. We have also computed several planar members of the obstruction set Ob4 for graphs with branchwidth at most four. This thesis will summarize previous results on branchwidth and reveal the previously mentioned new results.
dc.format.extent43 p.en_US
dc.format.mimetypeapplication/pdf
dc.identifier.callnoTHESIS MATH.SCI. 2001 RIGGINS
dc.identifier.citationRiggins, Kymberly Dawn. "On characterizing graphs with branchwidth at most four." (2001) Master’s Thesis, Rice University. <a href="https://hdl.handle.net/1911/17460">https://hdl.handle.net/1911/17460</a>.
dc.identifier.urihttps://hdl.handle.net/1911/17460
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.titleOn characterizing graphs with branchwidth at most four
dc.typeThesis
dc.type.materialText
thesis.degree.departmentMathematical Sciences
thesis.degree.disciplineEngineering
thesis.degree.grantorRice University
thesis.degree.levelMasters
thesis.degree.nameMaster of Science
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
1405703.PDF
Size:
1.16 MB
Format:
Adobe Portable Document Format
Download
Collections
Rice University Electronic Theses and Dissertations