Some results on structure of arbitrary arc-locally (out) in-semicomplete digraphs (Q6087340)

The paper characterizes the structure of arbitrary arc-locally (out) in-semicomplete digraphs and arbitrary arc-locally semicomplete digraphs, and shows that the structure of these digraphs is very similar to diperfect digraphs by proving that if \(D\) is a connected arc-locally (out) in-semicomplete digraph, then \(D\) is diperfect, or \(D\) admits a special partition of its vertices, or \(D\) has a clique cut and that if \(D\) is a connected arc-locally semicomplete digraph, then \(D\) is either a diperfect digraph or an odd extended cycle of length at least five. Notice that a digraph \(D\) is arc-locally semicomplete if \(D\) is both arc-locally in-semicomplete and arc-locally out-semicomplete. Finally, the authors claim that the characterization of the structure of arbitrary arc-locally (in-)semicomplete digraphs may be useful in verifying conjectures for this class of digraphs, and in particular in approaching Berge's conjecture.