On characterizing graphs with branchwidth at most four

dc.contributor.advisorDean, Nathanielen_US
dc.creatorRiggins, Kymberly Dawnen_US
dc.date.accessioned2009-06-04T08:09:06Zen_US
dc.date.available2009-06-04T08:09:06Zen_US
dc.date.issued2001en_US
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.en_US
dc.format.extent43 p.en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.callnoTHESIS MATH.SCI. 2001 RIGGINSen_US
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>.en_US
dc.identifier.urihttps://hdl.handle.net/1911/17460en_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.subjectOperations researchen_US
dc.titleOn characterizing graphs with branchwidth at most fouren_US
dc.typeThesisen_US
dc.type.materialTexten_US
thesis.degree.departmentMathematical Sciencesen_US
thesis.degree.disciplineEngineeringen_US
thesis.degree.grantorRice Universityen_US
thesis.degree.levelMastersen_US
thesis.degree.nameMaster of Scienceen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
1405703.PDF
Size:
1.16 MB
Format:
Adobe Portable Document Format