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 4 of 4 for “"uniquely colourable graphs"”.

  1. Uniqueness and Complexity in Generalised Colouring

    … in large part, as the recognition of a family of graphs that are colourable according to certain rules. In this thesis, we study additive induced-hereditary families, and some generalisations, from a colouring perspective. Our main results are: · Additive induced-hereditary families are uniquely …

    waterloo Repository record for Uniqueness and Complexity in Generalised Colouring (opens in a new tab)

  2. The chromatic index of simple graphs

    … (i) to study the structural properties of graphs which are critical with respect to edge-colourings; (ii) to apply the results obtained to the classification problem arising from Vizing's Theorem. Chapter 1 contains a historical, non-technical introduction, general graph-theoretic …

    the-open-u Download PDF for The chromatic index of simple graphs (opens in a new tab)

  3. D-colorable digraphs with large girth

    … proved, nonconstructively, that there exist graphs that have both arbitrarily large girth and arbitrarily large chromatic number. This result, along with its proof, has had a number of descendants (D. Bokal, G. Fijavz, M. Juvan, P.M. Kayll and B. Mohar, <italic>The circular chromatic number …

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

  4. D-colorable digraphs with large girth

    … proved, nonconstructively, that there exist graphs that have both arbitrarily large girth and arbitrarily large chromatic number. This result, along with its proof, has had a number of descendants (D. Bokal, G. Fijavz, M. Juvan, P.M. Kayll and B. Mohar, <italic>The circular chromatic number …

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