Repository logo
English
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
Repository logo
  • Communities & Collections
  • All of R-3
English
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Riggins, Kymberly Dawn"

Now showing 1 - 2 of 2
Results Per Page
Sort Options
  • Loading...
    Thumbnail Image
    Item
    On Characterizing Graphs with Branchwidth at Most Four
    (2001-04) Riggins, Kymberly Dawn
    There are several ways in which we can characterize classes of graphs. One such way of classifying graphs is by their brachwidth. In working to characterize the class of graphs with brachwidth at most four beta4 we have found a set of reductions that reduces members of beta4 to the zero graph. We have also computed several planar members of the obstruction set O_beta4 for graphs with branchwidth at most four. This thesis will summarize previous results on branchwidth and reveal the previously mentioned new results.
  • Loading...
    Thumbnail Image
    Item
    On characterizing graphs with branchwidth at most four
    (2001) Riggins, Kymberly Dawn; Dean, Nathaniel
    There 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.
  • About R-3
  • Report a Digital Accessibility Issue
  • Request Accessible Formats
  • Fondren Library
  • Contact Us
  • FAQ
  • Privacy Notice
  • R-3 Policies

Physical Address:

6100 Main Street, Houston, Texas 77005

Mailing Address:

MS-44, P.O.BOX 1892, Houston, Texas 77251-1892