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

  1. Coloring problems in graph theory

    … coloring problems for graphs: list coloring and packing coloring. We introduce a new variation to list coloring which we call choosability with union separation: For a graph G, a list assignment L to the vertices of G is a (k,k+t)-list assignment if every vertex is assigned a list of size at …

    iastate Repository record for Coloring problems in graph theory (opens in a new tab)

  2. Extremal problems on special graph colorings

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2020-10-02 without embargo terms

    uiuc Repository record for Extremal problems on special graph colorings (opens in a new tab)