Title of article
Fractional Colouring and Hadwigerʹs Conjecture
Author/Authors
Reed، نويسنده , , Bruce and Seymour، نويسنده , , Paul، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
6
From page
147
To page
152
Abstract
LetGbe 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∋v q(S)=1 for every vertexv, and ∑S q(S)⩽2p.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1998
Journal title
Journal of Combinatorial Theory Series B
Record number
1526410
Link To Document