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 “"Graph thickness"”.

  1. PLANAR GRAPHS, BIPLANAR GRAPHS AND GRAPH THICKNESS

    A graph is planar if it can be drawn on a piece of paper such that no two edges cross. The smallest complete and complete bipartite graphs that are not planar are K5 and K{3,3}. A biplanar graph is a graph whose edges can be colored using red and blue such that the red edges induce a planar …

    csusb Repository record for PLANAR GRAPHS, BIPLANAR GRAPHS AND GRAPH THICKNESS (opens in a new tab)

  2. Visualizing graphs: optimization and trade-offs

    Effective visualization of graphs is a powerful tool to help understand the relationships among the graph's underlying objects and to interact with them. Several styles for drawing graphs have emerged over the last three decades. Polyline drawing is a widely used style for drawing graphs, where …

    manitoba Repository record for Visualizing graphs: optimization and trade-offs (opens in a new tab)