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 5 of 5 for “"List Chromatic Number"”.

  1. On List-Coloring and the Sum List Chromatic Number of Graphs.

    … thesis explores several of the major results in list-coloring in an expository fashion. As a specialization of list coloring, the sum list chromatic number is explored in detail. Ultimately, the thesis is designed to motivate the discussion of coloring problems and, hopefully, interest the reader …

    vcu Repository record for On List-Coloring and the Sum List Chromatic Number of Graphs. (opens in a new tab)

  2. Hall's condition and list coloring.

    … each {dollar}v\\in V(G){dollar} let L(v) be a list assignment to G. The well-known choice number c(G) (or sometimes referred to as list chromatic number of G) is the least integer j such that if {dollar}\\vert L(v)\\vert\\ge j{dollar} for all {dollar}v\\in V(G){dollar} then G has a proper …

    wvu Repository record for Hall's condition and list coloring. (opens in a new tab)

  3. List colouring hypergraphs and extremal results for acyclic graphs

    … in graphs and hypergraphs. The first one is on list-colouring hypergraphs, which is a generalization of the ordinary colouring of hypergraphs. We discuss two methods for determining the list-chromatic number of hypergraphs. One method uses hypergraph polynomials, which invokes Alon's …

    waterloo Repository record for List colouring hypergraphs and extremal results for acyclic graphs (opens in a new tab)

  4. Extremal problems on variations of graph colorings

    … We produce a result of this type for the list chromatic number; namely, we prove that given a graph $G$ with maximum degree at least $10^{20}$, if $G$ has no clique of size $\Delta(G)$, then $G$ is $(\Delta(G)-1)$-choosable. Cai, Wang, and Zhu proved that a toroidal graph with no 6-cycles …

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

  5. Extremal problems in graph theory

    … of small radius and find the domination number of the Kneser graph $K(n,k)$ when $n\ge{3\over4}k\sp2\pm k,$ depending on whether k is even or odd. The path chromatic number $\chi\sb{P}(G)$ of a graph G is the least number of colors with which the vertices of G can be colored so that each …

    uiuc Repository record for Extremal problems in graph theory (opens in a new tab)