$3$-anti-circulant digraphs are $\alpha$-diperfect and BE-diperfect
Lucas Ismaily Bezerra Freitas, Orlando Lee

TL;DR
This paper proves that 3-anti-circulant digraphs are both $eta$-diperfect and BE-diperfect, confirming conjectures and providing structural insights into these classes of digraphs.
Contribution
The authors verify conjectures for 3-anti-circulant digraphs being $eta$-diperfect and BE-diperfect, and offer structural results for these classes.
Findings
3-anti-circulant digraphs are $eta$-diperfect.
3-anti-circulant digraphs are BE-diperfect.
Structural properties of $eta$-diperfect and BE-diperfect digraphs are presented.
Abstract
Let be a digraph. A subset of is a stable set if every pair of vertices in is non-adjacent in . A collection of disjoint paths of is a path partition of , if every vertex in is exactly on a path of . We say that a stable set and a path partition are orthogonal if each path of contains exactly one vertex of . A digraph satisfies the -property if for every maximum stable set of , there exists a path partition such that and are orthogonal. A digraph is -diperfect if every induced subdigraph of satisfies the -property. In 1982, Claude Berge proposed a characterization for -diperfect digraphs in terms of forbidden anti-directed odd cycles. In 2018, Sambinelli, Silva and Lee proposed a similar conjecture. A digraph …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Advanced Algebra and Logic · Graph Labeling and Dimension Problems
