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 “"Cocktail party graph"”.

  1. On 2-primitive triangle decompositions of cocktail party graphs

    A decomposition of a graph Γ is a collection C of subgraphs, perhaps nonisomorphic, that partition the edges of Γ. Analogously, consider a group of truck drivers whose non-overlapping routes jointly cover all of the roads between a set of cities; that is, each road is traversed by precisely one …

    marshall Repository record for On 2-primitive triangle decompositions of cocktail party graphs (opens in a new tab)