Characterization of BE-diperfect digraphs by blocking odd cycles

Let DD be a digraph. A digraph is BE-diperfect according to the definition in the source, and a blocking odd cycle is the obstruction defined there.

Proposed characterization. A digraph DD is BE-diperfect if, and only if, DD has no blocking odd cycle as an induced subdigraph.

The authors propose this characterization as analogous to Berge's proposed characterization of alpha-diperfect digraphs. The supplied text does not indicate whether it has been resolved.

Sources & referencesView supporting material

Primary source

Cândida Nunes da Silva, Orlando Lee and Maycon Sambinelli, “Perfect digraphs”, arXiv:1904.02799 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.