Claw-free graphs VI. Colouring

Authors:
Maria Chudnovsky;Paul Seymour
Affiliations:
Columbia University, New York, NY 10027, United States;Princeton University, Princeton, NJ 08544, United Sates
Venue:
Journal of Combinatorial Theory Series B
Year:
2010

Citing 3
Cited 4

The Ramsey number R(3, t) has order of magnitude t2/log t

Random Structures & Algorithms
Claw-free graphs. II. Non-orientable prismatic graphs

Journal of Combinatorial Theory Series B
Claw-free graphs. V. Global structure

Journal of Combinatorial Theory Series B

Dominating set is fixed parameter tractable in claw-free graphs

Theoretical Computer Science
Clique minors in claw-free graphs

Journal of Combinatorial Theory Series B
The structure of bull-free graphs I-Three-edge-paths with centers and anticenters

Journal of Combinatorial Theory Series B
Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we prove that if G is a connected claw-free graph with three pairwise non-adjacent vertices, with chromatic number @g and clique number @w, then @g=