Antistrong digraphs
From MaRDI portal
Publication:345072
DOI10.1016/j.jctb.2016.05.004zbMath1350.05048arXiv1605.07832OpenAlexW4212790289MaRDI QIDQ345072
Matthias Kriesell, Stéphane Bessy, Bill Jackson, Jörgen Bang-Jensen
Publication date: 25 November 2016
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.07832
Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20)
Related Items (7)
Rainbow antistrong connection in tournaments ⋮ Analyzing the reachability problem in choice networks ⋮ Proper‐walk connection number of graphs ⋮ Ore conditions for antistrong digraphs ⋮ Reachability in choice networks ⋮ Necessary and sufficient conditions for circulant digraphs to be antistrong, weakly-antistrong and anti-Eulerian ⋮ The antistrong property for special digraph families
Cites Work
- Arc-disjoint spanning sub(di)graphs in digraphs
- Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs
- A rooted-forest partition with uniform vertex demand
- Signed graphs
- Connected Detachments of Graphs and Generalized Euler Trails
- Digraphs
- Minimum partition of a matroid into independent subsets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Antistrong digraphs
