-diperfect digraphs
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)
Full work available at URL: https://arxiv.org/abs/1904.02799
Recommendations
Directed graphs (digraphs), tournaments (05C20) 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)
Cites Work
- Graph theory
- Normal hypergraphs and the perfect graph conjecture
- A classification of locally semicomplete digraphs
- Locally semicomplete digraphs: A generalization of tournaments
- Connectivity properties of locally semicomplete digraphs
- Digraphs
- The strong perfect graph theorem
- Title not available (Why is that?)
- List edge-colorings of series-parallel graphs
- Title not available (Why is that?)
- Decomposing series-parallel graphs into paths of length 3 and triangles
- A characterization of locally semicomplete CKI-digraphs
- Generalizations of tournaments: A survey
- In-tournament digraphs
- Independent sets and non-augmentable paths in generalizations of tournaments
- Longest path partitions in generalizations of tournaments
- The Merino-Welsh conjecture holds for series-parallel graphs
- On complementary cycles in locally semicomplete digraphs
- A note on spanning local tournaments in locally semicomplete digraphs
- Nonempty intersection of longest paths in series-parallel graphs
- Note on a min-max conjecture of Woodall
- Diperfect graphs
- Digraphs with the path‐merging property
- About colorings, stability and paths in directed graphs
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)