NDLTD logo NDLTD Union Catalog and Global ETD Search

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

  1. On the Attainability of Upper Bounds for the Circular Chromatic Number of <em>K</em><sub>4</sub>-Minor-Free Graphs.

    Holt, Tracy Lance2008

    … is an edge of <em>G</em>. We say that the circular chromatic number of <em>G</em>, denoted <em>χ<sub>c</sub></em>(<em>G</em>), is equal to the smallest <em>k</em>/<em>d</em> where a <em>k</em>/<em>d</em> -coloring exists. In [6], Pan and Zhu have given a function <em>μ</em>(<em>g</em>) that …

    etsu Repository record