| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8902860 | Discrete Mathematics | 2018 | 6 Pages |
Abstract
Verifying a conjecture of Brewster, Foucaud, Hell and Naserasr, we show that signed (H,Î )-colouring is NP-complete for any signed graph (H,Î ) whose s-core has at least 3 edges.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Richard C. Brewster, Mark Siggers,