Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"polyhedral graph"”.

  1. Characterizing the polyhedral graphs with positive combinatorial curvature

    A polyhedral graph G is called PCC if every vertex of G has strictly positive combinatorial curvature and the graph is not a prism or antiprism. In this thesis it is shown that the maximum order of a 3-regular PCC graph is 132 and the 3-regular PCC graphs which match that bound are enumerated. A …

    uvic Repository record for Characterizing the polyhedral graphs with positive combinatorial curvature (opens in a new tab)

  2. New Tools and Results in Graph Structure Theory

    … prove a ``non-embeddable extensions' theorem for polyhedral graph embeddings. Let G be a ``weakly 4-connected' planar graph. We describe a set of constructions that produce a finite list of non-planar graphs, each having a minor isomorphic to G, such that every non-planar weakly 4-connected graph …

    gatech Repository record for New Tools and Results in Graph Structure Theory (opens in a new tab)