| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8902986 | Discrete Mathematics | 2018 | 14 Pages |
Abstract
We show that for a reflexive digraph cycle H and a reflexive digraph G, the problem of determining whether there is a path between two maps in Col(G,H) can be solved in time polynomial in G. When G is not reflexive, we show the same except for certain digraph 4-cycles H.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Richard C. Brewster, Jae-baek Lee, Mark Siggers,