The Library
Deciding k-colorability of P5-free graphs in polynomial time
Tools
Hoang, Chinh T., Kaminski, Marcin, Lozin, Vadim V., Sawada, Joe and Shu, Xiao (2010) Deciding k-colorability of P5-free graphs in polynomial time. Algorithmica, Vol.57 (No.1). pp. 74-81. doi:10.1007/s00453-008-9197-8 ISSN 0178-4617.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1007/s00453-008-9197-8
Abstract
The problem of computing the chromatic number of a P (5)-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show that for every fixed integer k, there exists a polynomial-time algorithm determining whether or not a P (5)-free graph admits a k-coloring, and finding one, if it does.
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software Q Science > QA Mathematics |
||||
Divisions: | Faculty of Science, Engineering and Medicine > Science > Mathematics | ||||
Journal or Publication Title: | Algorithmica | ||||
Publisher: | Springer Verlag | ||||
ISSN: | 0178-4617 | ||||
Official Date: | May 2010 | ||||
Dates: |
|
||||
Volume: | Vol.57 | ||||
Number: | No.1 | ||||
Number of Pages: | 8 | ||||
Page Range: | pp. 74-81 | ||||
DOI: | 10.1007/s00453-008-9197-8 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Access rights to Published version: | Restricted or Subscription Access | ||||
Funder: | NSERC |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |