Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
418921 | Discrete Applied Mathematics | 2015 | 6 Pages |
Abstract
We design an O(n3)O(n3) algorithm to find a minimum weighted coloring of a (P5,P¯5)-free graph. Furthermore, the same technique can be used to solve the same problem for several classes of graphs, defined by forbidden induced subgraphs, such as (diamond, co-diamond)-free graphs.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Chính T. Hoàng, D. Adam Lazzarato,