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

  1. Polychromatic colorings of certain subgraphs of complete graphs and maximum densities of substructures of a hypercube

    … graph and H is a set of subgraphs of G, an edge-coloring of G is H-polychromatic if every graph from H gets all colors present in G on its edges. The H-polychromatic number of G, polyHG, is the largest number of colors in an H-polychromatic coloring. We determine polyHG exactly when G is a …

    wvu Repository record for Polychromatic colorings of certain subgraphs of complete graphs and maximum densities of substructures of a hypercube (opens in a new tab)

  2. A polychromatic approach to a Turán-type problem in finite groups

    … \} + S$ is called a {\em translate} of $S$. A coloring of the elements of $G$ is {\em $S-$polychromatic} if every translate of $S$ contains an element of each color. The largest number of colors allowing an $S-$polychromatic coloring of the translates of $S$ is known as the {\em polychromatic …

    iastate Repository record for A polychromatic approach to a Turán-type problem in finite groups (opens in a new tab)