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

  1. Quantum Algorithms For: Quantum Phase Estimation, Approximation Of The Tutte Polynomial And Black-box Structures

    … evaluating the Tutte polynomial of triangular graphs at the points (q, 1/q) of the Tutte plane is BQP-complete for (most) roots of unity q. We also consider circular graphs and show that the problem of approximately evaluating the Tutte polynomial of these graphs at the point (e 2πi/5 ,e−2πi/5 …

    ucf Repository record for Quantum Algorithms For: Quantum Phase Estimation, Approximation Of The Tutte Polynomial And Black-box Structures (opens in a new tab)

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

    … d, whenever xy is an edge of G. We say that the circular chromatic number of G, denoted χc(G), is equal to the smallest k/d where a k/d -coloring exists. In [6], Pan and Zhu have given a function μ(g) that gives an upper bound for the circular-chromatic number for every K4-minor-free graph Gg of …

    etsu Repository record for On the Attainability of Upper Bounds for the Circular Chromatic Number of <em>K</em><sub>4</sub>-Minor-Free Graphs. (opens in a new tab) Download PDF for On the Attainability of Upper Bounds for the Circular Chromatic Number of <em>K</em><sub>4</sub>-Minor-Free Graphs. (opens in a new tab)