\(\alpha\)-diperfect digraphs
From MaRDI portal
Publication:2113335
DOI10.1016/j.disc.2021.112759zbMath1484.05088arXiv1904.02799OpenAlexW4205489416MaRDI QIDQ2113335
Maycon Sambinelli, Orlando Lee, C. Nunes da Silva
Publication date: 14 March 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.02799
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items (2)
Some results on Berge's conjecture and begin-end conjecture ⋮ A family of counterexamples for a conjecture of Berge on \(\alpha\)-diperfect digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposing series-parallel graphs into paths of length 3 and triangles
- A characterization of locally semicomplete CKI-digraphs
- Nonempty intersection of longest paths in series-parallel graphs
- The strong perfect graph theorem
- About colorings, stability and paths in directed graphs
- A note on spanning local tournaments in locally semicomplete digraphs
- In-tournament digraphs
- On complementary cycles in locally semicomplete digraphs
- A classification of locally semicomplete digraphs
- List edge-colorings of series-parallel graphs
- Diperfect graphs
- Independent sets and non-augmentable paths in generalizations of tournaments
- Longest path partitions in generalizations of tournaments
- Normal hypergraphs and the perfect graph conjecture
- The Merino-Welsh conjecture holds for series-parallel graphs
- Note on a min-max conjecture of Woodall
- Locally semicomplete digraphs: A generalization of tournaments
- Generalizations of tournaments: A survey
- Connectivity properties of locally semicomplete digraphs
- Digraphs with the path‐merging property
- Digraphs
This page was built for publication: \(\alpha\)-diperfect digraphs
