k-Colorability of P5-free graphs

Simple item page
dc.creatorHoang, C. T.
dc.creatorSawada, J.
dc.creatorShu, X.
dc.date2006-09-14
dc.date.accessioned2026-07-07T07:23:53Z
dc.date.available2026-07-07T07:23:53Z
dc.descriptionA 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.
dc.identifierhttps://arxiv.org/abs/cs/0609083
dc.identifierhttp://arxiv.org/abs/cs/0609083
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/116147
dc.subjectDiscrete Mathematics
dc.subjectData Structures and Algorithms
dc.subjectG.2.2
dc.titlek-Colorability of P5-free graphs
dc.typetext

Files

Collections

arXiv