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 1 of 1 for “"Crossing Sequences"”.

  1. Highly Non-Convex Crossing Sequences

    For a given graph, G, the crossing number crₐ(G) denotes the minimum number of edge crossings when a graph is drawn on an orientable surface of genus a. The sequence cr₀(G), cr₁(G), ... is said to be the crossing sequence of a G. An equivalent definition exists for non-orientable surfaces. In 1983, …

    waterloo Repository record for Highly Non-Convex Crossing Sequences (opens in a new tab)