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

  1. Restricted and Unrestricted Coverings of Complete Bipartite Graphs with Hexagons

    <p>A minimal covering of a graph G with isomorphic copies of graph H is a set {H<sub>1</sub>, H<sub>2</sub>, H<sub>3</sub>, ... , H<sub>n</sub>} where H<sub>i</sub> is isomorphic to H, the vertex set of H<sub>i</sub> is a subset of G, the edge set of G is a subset of the union of H<sub>i</sub>'s, …

    etsu Repository record for Restricted and Unrestricted Coverings of Complete Bipartite Graphs with Hexagons (opens in a new tab)