Bang-Jensen–Hell conjecture for directed graph homomorphism problems
Statement
Let be a connected directed graph in which every vertex has positive indegree and outdegree. Let the core of mean its core under directed graph homomorphisms.
Bang-Jensen–Hell conjecture. If the core of is a directed cycle, then the -colouring problem is polynomial-time solvable. Otherwise, it is NP-complete.
This is a proposed dichotomy classification for directed graphs whose vertices all have positive indegree and outdegree. The conjecture remains open, although many special cases are known.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.