-diperfect digraphs

From MaRDI portal
Publication:2113335

DOI10.1016/J.DISC.2021.112759zbMATH Open1484.05088arXiv1904.02799OpenAlexW4205489416MaRDI QIDQ2113335FDOQ2113335

Maycon Sambinelli, Orlando Lee, C. Nunes da Silva

Publication date: 14 March 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: Let D be a digraph. Given a set of vertices SsubseteqV(D), an S-path partition mathcalP of D is a collection of paths of D such that V(P)colonPinmathcalP is a partition of V(D) and |V(P)capS|=1 for every PinmathcalP. We say that D satisfies the alpha-property if, for every maximum stable set S of D, there exists an S-path partition of D, and we say that D is alpha-diperfect if every induced subdigraph of D satisfies the alpha-property. A digraph C is an anti-directed odd cycle if (i) the underlying graph of C is a cycle x1x2cdotsx2k+1x1, where kinmathbbZ and kgeq2, and (ii) each of the vertices x1,x2,x3,x4,x6, x8,ldots,x2k is either a source or a sink. Berge (1982) conjectured that a digraph is alpha-diperfect if, and only if, it contains no induced anti-directed odd cycle. Remark that this conjecture is strikingly similar to Berge's conjecture on perfect graphs -- nowadays known as the Strong Perfect Graph Theorem (Chudnovsky, Robertson, Seymour, and Thomas, 2006). To the best of our knowledge, Berge's conjecture for alpha-diperfect digraphs has been verified only for symmetric digraphs and digraphs whose underlying graph are perfect. In this paper, we verify it for digraphs whose underlying graphs are series-parallel and for in-semicomplete digraphs. Moreover, we propose a conjecture similar to Berge's and verify it for all the known cases of Berge's conjecture.


Full work available at URL: https://arxiv.org/abs/1904.02799




Recommendations




Cites Work


Cited In (5)





This page was built for publication: \(\alpha\)-diperfect digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113335)