Article ID Journal Published Year Pages File Type
4647745 Discrete Mathematics 2013 8 Pages PDF
Abstract
In a recent paper we have shown that if s≥3, s- COLr is NP-hard for linear forests if s
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
The complexity of the empire colouring problem for linear forests
Authors
, ,