The Library
A note on k-colorability of P 5-free graphs
Tools
Hoàng, Chính T., Kamiński, Marcin, Lozin, Vadim V., Sawada, Joe and Shu, Xiao (2008) A note on k-colorability of P 5-free graphs. Lecture Notes in Computer Science, Vol.5162 . pp. 387-394. doi:10.1007/978-3-540-85238-4_31 ISSN 0302-9743.
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/978-3-540-85238-4_31
Abstract
We present a polynomial-time algorithm determining whether or not, for a fixed k, a P 5-free graph can be k-colored. If such a coloring exists, the algorithm will produce one.
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics | ||||
Divisions: | Faculty of Science, Engineering and Medicine > Science > Mathematics | ||||
Journal or Publication Title: | Lecture Notes in Computer Science | ||||
Publisher: | Springer | ||||
ISSN: | 0302-9743 | ||||
Book Title: | Mathematical Foundations of Computer Science 2008 | ||||
Official Date: | 2008 | ||||
Dates: |
|
||||
Volume: | Vol.5162 | ||||
Page Range: | pp. 387-394 | ||||
DOI: | 10.1007/978-3-540-85238-4_31 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |