journal articleresearch article
oaidoi:10.1006/jctb.1998.1835

Fractional Colouring and Hadwiger's Conjecture

Authors
Publication date
30 November 1998
Publisher
Academic Press.
Doi

    Abstract

    AbstractLetGbe a loopless graph with noKp+1minor. We prove that the “fractional chromatic number” ofGis at most 2p; that is, it is possible to assign a rationalq(S)⩾0 to every stable setS⊆V(G) so that ∑S∋vq(S)=1 for every vertexv, and ∑Sq(S)⩽2p

    Similar works

    Full text

    thumbnail-image

    Elsevier - Publisher Connector

    redirect
    oaidoi:10.1006/jctb.1998.1835
    Last time updated on 06/05/2017

    This paper was published in Elsevier - Publisher Connector .

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.