On the Circular Chromatic Number of Circular Partitionable GraphsReport as inadecuate




On the Circular Chromatic Number of Circular Partitionable Graphs - Download this document for free, or read online. Document in PDF available to download.

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique 2 Realopt - Reformulations based algorithms for Combinatorial Optimization LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest 3 Department of Applied Mathematics Kaohsiung

Abstract : This paper studies the circular chromatic number of a class of circular partitionable graphs. We prove that an infinite family of circular partitionable graphs Ghas Xc G = X G. A consequence of this result is that we obtain an infinite family of graphs G with the rare property that the deletion of each vertex decreases its circular chromatic number by exactly 1





Author: Arnaud Pêcher - Xuding Zhu -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents