The complexity of restricted graph homomorphisms
- 15 April 1997
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 167-168, 145-154
- https://doi.org/10.1016/s0012-365x(96)00223-3
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- The Existence of Homomorphisms to Oriented CyclesSIAM Journal on Discrete Mathematics, 1995
- Hereditarily hard H-colouring problemsDiscrete Mathematics, 1995
- The Complexity of Infinite H-ColoringJournal of Combinatorial Theory, Series B, 1994
- The core of a graphDiscrete Mathematics, 1992
- A note on restricted H-colouringInformation Processing Letters, 1991
- On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive DigraphsSIAM Journal on Discrete Mathematics, 1991
- On the complexity of H-coloringJournal of Combinatorial Theory, Series B, 1990
- Pair Labellings with Given DistanceSIAM Journal on Discrete Mathematics, 1989
- The Complexity of Colouring by Semicomplete DigraphsSIAM Journal on Discrete Mathematics, 1988
- On multiplicative graphs and the product conjectureCombinatorica, 1988