Abstract
Let H be a directed graph whose vertices are called colours. An H-colouring of a digraph G is an assignment of these colours to the vertices of G so that if g is adjacent to g′ in G then colour(g) is adjacent to colour(g′) in H (i.e., a homomorphism G→H). In this paper we continue the study of the H-colouring problem, that is, the decision problem ‘Is there an H-colouring of a given digraph G?’ It follows from a result of Hell and Nešetřil that this problem is NP-complete whenever H contains a symmetric odd cycle. We consider digraphs for which the symmetric part of H is bipartite, that is, digraphs H which can be constructed from the equivalence digraph of an undirected bipartite graph by adding some arcs. We establish some sufficient conditions for these H-colouring problems to be NP-complete. A complete classification is established for the subclass of ‘partitionable digraphs’, which we introduce.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
