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 3 of 3 for “"Acyclic Coloring"”.

  1. Covering and packing problems on graphs and hypergraphs

    Item reinstated by Sarah Shreeves (sshreeve@illinois.edu) on 2013-08-27T10:00:22Z Item was in collections: University of Illinois Dissertations and Theses (ID: 204) Dissertations and Theses - Mathematics (ID: 749) No. of bitstreams: 3 Stocker_Christopher.pdf.txt: 236192 bytes, checksum: …

    uiuc Repository record for Covering and packing problems on graphs and hypergraphs (opens in a new tab)

  2. D-colorable digraphs with large girth

    … and X. Zhu, <italic>On sparse graphs with given colorings and homomorphisms</italic>, J. Combin. Theory Ser. B <bold>90</bold> (2004), 161-172; X. Zhu, <italic>Uniquely H-colorable graphs with large girth</italic>, J. Graph Theory <bold>23</bold> (1996), 33-41) that have extended and generalized …

    montana-tech Repository record for D-colorable digraphs with large girth (opens in a new tab)

  3. D-colorable digraphs with large girth

    … and X. Zhu, <italic>On sparse graphs with given colorings and homomorphisms</italic>, J. Combin. Theory Ser. B <bold>90</bold> (2004), 161-172; X. Zhu, <italic>Uniquely H-colorable graphs with large girth</italic>, J. Graph Theory <bold>23</bold> (1996), 33-41) that have extended and generalized …

    montana Repository record for D-colorable digraphs with large girth (opens in a new tab)