Polynomial-time algorithm for vertex k-colorability of P_5-free graphs

Simple item page
dc.creatorKaminski, Marcin
dc.creatorLozin, Vadim
dc.date2006-07-26
dc.date.accessioned2026-07-07T07:16:24Z
dc.date.available2026-07-07T07:16:24Z
dc.descriptionWe give the first polynomial-time algorithm for coloring vertices of P_5-free graphs with k colors. This settles an open problem and generalizes several previously known results.
dc.identifierhttps://arxiv.org/abs/cs/0607115
dc.identifierhttp://arxiv.org/abs/cs/0607115
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/113577
dc.subjectDiscrete Mathematics
dc.subjectData Structures and Algorithms
dc.titlePolynomial-time algorithm for vertex k-colorability of P_5-free graphs
dc.typetext

Files

Collections

arXiv