Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices (Q458608)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices
scientific article

    Statements

    Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 October 2014
    0 references
    0 references
    choosability
    0 references
    list chromatic number
    0 references
    0 references
    0 references
    0 references