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 “"Visibility numbers"”.

  1. Rectangle Visibility Numbers of Graphs

    … to edges. We say that a graph G has a rectangle visibility representation if we can assign each vertex of G to a unique axis-aligned rectangle in the plane such that two vertices u and v are adjacent if and only if there exists an unobstructed horizontal or vertical channel of finite width …

    rit Repository record for Rectangle Visibility Numbers of Graphs (opens in a new tab)