\(B_ 1\)- and \(B_ 2\)-orientable graphs in kernel theory (Q1897444): Difference between revisions

\textit{P. Duchet} and \textit{H. Meyniel} [Discrete Math. 33, 103-105 (1981; Zbl 0456.05032)] conjectured that if \(D\) is a digraph such that every odd directed cycle possesses two pseudodiagonals then \(D\) is kernel perfect. This conjecture holds only for special classes of digraphs, see i.e. \textit{P. Duchet} and \textit{H. Meyniel} [Discrete Math. 43, 21-27 (1983; Zbl 0502.05027)], and \textit{H. Galeana-Sánchez} [Discrete Math. 41, 105-107 (1982; Zbl 0484.05035)]. A digraph \(D\) is called \(B_1\)-oriented \([B_2\)-oriented], see \textit{D. J. Skrien} [J. Graph Theory 6, 309-316 (1982; Zbl 0495.05027)], if for each pair of arcs \((u,w)\), \((v,w)\) \([(w,u), (w,v)]\) also \((u,v)\) \([(v,u)]\) is an arc in \(D\). Here the author proves the conjecture for digraphs which are locally \(B_1\)- or \(B_2\)- oriented.