k-Colorability of P5-free graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

A polynomial time algorithm that determines for a fixed integer k whether or not a P5-free graph can be k-colored is presented in this paper. If such a coloring exists, the algorithm will produce a valid k-coloring.

Keywords

Discrete Mathematics, Data Structures and Algorithms, G.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/116147

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0609083
 http://arxiv.org/abs/cs/0609083

Collections

arXiv