Claw-free Graphs VI. Colouring Claw-free Graphs
نویسندگان
چکیده
In this paper we prove that if G is a connected claw-free graph with three pairwise non-adjacent vertices, with chromatic number χ and clique number ω, then χ ≤ 2ω and the same for the complement of G. We also prove that the choice number of G is at most 2ω, except possibly in the case when G can be obtained from a subgraph of the Schläfli graph by replicating vertices. Finally, we show that the constant 2 is best possible in all cases.
منابع مشابه
Characterising claw-free t-perfect graphs
We characterise the class of all claw-free t-perfect graphs by forbidden t-minors. Moreover, we show that claw-free t-perfect graphs are 3-colourable. Such a colouring can be obtained in polynomial time.
متن کاملOn claw-free t-perfect graphs
A graph is called t-perfect, if its stable set polytope is defined by nonnegativity, edge and odd-cycle inequalities. We characterise the class of all claw-free t-perfect graphs by forbidden t-minors. Moreover, we show that claw-free t-perfect graphs are 3-colourable. Such a colouring can be obtained in polynomial time.
متن کامل4-regular claw-free IM-extendable graphs
A graph G is induced matching extendable (shortly, IM-extendable), if every induced matching of G is included in a perfect matching of G. A graph G is claw-free, if G does not contain any induced subgraph isomorphic toK1,3. The kth power of a graphG, denoted byGk , is the graph with vertex set V (G) in which two vertices are adjacent if and only if the distance between them in G is at most k. I...
متن کاملPartial List Colouring of Certain Graphs
The partial list colouring conjecture due to Albertson, Grossman, and Haas [1] states that for every s-choosable graph G and every assignment of lists of size t, 1 6 t 6 s, to the vertices of G there is an induced subgraph of G on at least t|V (G)| s vertices which can be properly coloured from these lists. In this paper, we show that the partial list colouring conjecture holds true for certain...
متن کاملAsymptotics of the chromatic number for quasi-line graphs
As proved by Kahn, the chromatic number and fractional chromatic number of a line graph agree asymptotically. That is, for any line graph G we have χ(G) ≤ (1 + o(1))χf (G). We extend this result to quasi-line graphs, an important subclass of claw-free graphs. Furthermore we prove that we can construct a colouring that achieves this bound in polynomial time, giving us an asymptotic approximation...
متن کامل