Claw-free circular-perfect graphs

Arnaud Pecher (1) , Xuding Zhu (2)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 Department of Applied Mathematics [Kaohsiung]

The circular chromatic number of a graph is a well studied refinement of the chromatic number. Circular perfect graphs is a superclass of perfect graphs defined by means of this more general coloring concept. This paper studies claw free circular perfect graphs. A consequence of the strong perfect graph theorem is that minimal circular perfect graphs G. In contrast to this result, it is shown in that minimal circular imperfect graphs G can have arbitrarily large independence number and arbitrarily large clique number.,

Domaines: Autre [cs.OH]

Arnaud Pecher, Xuding Zhu. Claw-free circular-perfect graphs. Eurocomb07 - European Conference on Combinatorics, Graph Theory and Applications, Sep 2007, Spain. pp.451--455. ⟨hal-00307765⟩