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 4 of 4 for “"plane graphs"”.

  1. Edge coloring of simple graphs and edge -face coloring of simple plane graphs

    … generalizes earlier results.;Given a simple plane graph G, an edge-face k-coloring of G is a function &phis; : E(G) ∪ F(G) {lcub}1, ···, k{rcub} such that, for any two adjacent elements a, b ∈ E(G) ∪ F(G), &phis;( a) ≠ &phis;(b). Denote chie( G), chief(G), …

    wvu Repository record for Edge coloring of simple graphs and edge -face coloring of simple plane graphs (opens in a new tab)

  2. Distances in planar graphs

    … diameter can have. The face-degree of a face in plane graph is the length of the shortest closed walk traversing the boundary of the face. A plane graph is ρ-face-degree regular if every face has face-degree ρ. This thesis begins with a literature review outlining the results and methods of …

    cape-town Repository record for Distances in planar graphs (opens in a new tab)

  3. The Structure of 4-Clusters in Fullerenes

    … either molecules of pure carbon or the trivalent plane graphs with all hexagonal and (exactly 12) pentagonal faces that models these molecules. Since carbon atoms have valence 4 and our models have valence 3, the edges of a perfect matching are doubled to bring the valence up to 4 at each vertex. …

    syracuse-diss Repository record for The Structure of 4-Clusters in Fullerenes (opens in a new tab)

  4. Tightening curves and graphs on surfaces

    … homotopy moves and a set of local operations on graphs called electrical transformations. Electrical transformations have been used to simplify electrical networks since the 19th century; later they have been used for solving various combinatorial problems on graphs, as well as applications in …

    uiuc Repository record for Tightening curves and graphs on surfaces (opens in a new tab)