On the complexity of colouring by superdigraphs of bipartite graphs

Discrete Mathematics

Volumn 109, Issue 1-3, 1992, Pages 27-44

  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 REGINA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041505367     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(92)90276-L     Document Type: Article

References (22)

1. Homomorphisms of 3-chromatic graphs II
2. The effect of two cycles on the complexity of colourings by directed graphs
3. The complexity of colourings by semicomplete digraphs
4. On unavoidable digraphs in orientations of graphs
5. Contractability and NP-completeness
6. On the complexity of theorem proving procedures
7. Polynomial graph colourings
8. On multiplicative graphs and the product conjecture
9. On the complexity of H-colouring
10. Coverings and colorings of hypergraphs
11. On classes of relations determined by subobjects and factorobjects
12. The complexity of generalized colourings
13. On the complexity of colourings by vertex-transitive and arc-transitive digraphs
14. On the complexity of the general colouring problem
15. The complexity of satisfiability problems
16. Colour families are dense