NP-completeness of the hull number problem for oriented chordal graphs
Statement
Let be an oriented graph and let be a positive integer. The underlying graph of is the graph obtained by ignoring the orientations of its arcs.
Oriented chordal hull-number conjecture. Determining whether
is NP-complete, even when the underlying graph of is chordal.
This would extend the known NP-hardness of determining the hull number of an undirected chordal graph to oriented graphs. The source presents the claim as an open problem; its precise complexity for oriented graphs with chordal underlying graphs remains open.
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.