Hereditarily hard H-colouring problems

Discrete Mathematics

Volumn 138, Issue 1-3, 1995, Pages 75-92

  Bang Jensen, Jørgen ^a   Hell, Pavol ^b   MacGillivray, Gary ^c  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^b SIMON FRASER UNIVERSITY   (Canada)

^c UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040890381     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(94)00189-P     Document Type: Article

References (33)

1. On the complexity of generalized colourings of directed graphs
2. The effect of two cycles on the complexity of colourings by directed graphs
3. The complexity of colourings by semicomplete digraphs
4. On the complexity of colouring by superdigraphs of bipartite graphs
5. Vertex colourings of edge-coloured graphs
6. Contractability and NP-completeness
7. On minimal graphs
8. The directed subgraph homeomorphism problem
9. Farbung durch gerichtete Graphen
10. Graph colourings
11. Polynomial graph colourings
12. On multiplicative graphs and the product conjecture
13. On the complexity of H-colouring
14. Duality and polynomial testing of tree homomorphisms
15. Complexity of tree homomorphisms
16. The existence of homomorphisms to oriented cycles
17. The NP-completeness column — An ongoing guide
18. The complexity of generalized colourings
19. The complexity of colouring by vertex-transitive and edge-transitive digraphs
20. Further effects of two directed cycles n the complexity of directed H-colouring
21. On the complexity of colouring by digraphs with at most one directed cycle
22. On the complexity of the general colouring problem
23. Colourings and interpretations: a connection between graphs and grammar forms
24. Representations of graphs by means of products and their complexity
25. On classes of relations determined by subobjects and factorobjects
26. Colour families are dense
27. A polynomial algorithm for homomorphisms to oriented cycles