Independent sets and non-augmentable paths in generalizations of tournaments
From MaRDI portal
Publication:2427505
DOI10.1016/j.disc.2007.05.016zbMath1147.05042OpenAlexW1988148977MaRDI QIDQ2427505
Hortensia Galeana-Sánchez, Ricardo Gómez
Publication date: 13 May 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.05.016
Related Items
Computational results on the traceability of oriented graphs of small order ⋮ Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs ⋮ A conjecture on 3-anti-quasi-transitive digraphs ⋮ Some results on 4-transitive digraphs ⋮ Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs ⋮ Traceability of \(k\)-traceable oriented graphs ⋮ The structure of strong arc-locally in-semicomplete digraphs ⋮ Quasi-Transitive Digraphs and Their Extensions ⋮ Miscellaneous Digraph Classes ⋮ \(\alpha\)-diperfect digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On kernel-perfect critical digraphs
- In-tournament digraphs
- Stable set meeting every longest path
- The structure of strong arc-locally semicomplete digraphs
- Independent sets which meet all longest paths
- Kernels and perfectness in arc-local tournament digraphs
- Longest path partitions in generalizations of tournaments
- Recent problems and results about kernels in directed graphs
- Locally semicomplete digraphs: A generalization of tournaments
- Generalizations of tournaments: A survey
- On independent sets and non-augmentable paths in directed graphs
- Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
- Quasi‐transitive digraphs
- Digraphs with the path‐merging property
- The directed path partition conjecture
