Thumbnail
Metadatos
Mostrar el registro completo del ítem
Licencia de uso del documento

On the Circular Chromatic Number of Circular Partitionable Graphs

PÊCHER, Arnaud
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
ZHU, Xuding
Department of Applied Mathematics [Kaohsiung]
Idioma
en
Article de revue
Este ítem está publicado en
Journal of Graph Theory. 2006-08, vol. 52, p. 294--306
Wiley
Resumen en inglés
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 ...Leer más >
URI
https://oskar-bordeaux.fr/handle/20.500.12278/191714
Orígen
Importado de Hal
Centros de investigación