On the acyclic disconnection of multipartite tournaments
From MaRDI portal
(Redirected from Publication:427897)
Recommendations
Cites work
- A class of tight circulant tournaments
- Circulant tournaments of prime order are tight
- Dichromatic number, circulant tournaments and Zykov sums of digraphs
- Digraphs
- Infinite families of tight regular tournaments
- On a Conjecture of Víctor Neumann-Lara
- Retracts of strong products of graphs
- The acyclic disconnection of a digraph
- The dichromatic number of a digraph
Cited in
(13)- On high-dimensional acyclic tournaments
- The acyclic and C₃-free disconnection of tournaments
- Acyclic sets in k-majority tournaments
- Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments
- Solution of a conjecture of Vandell on decycling bipartite tournaments by deleting arcs
- On the acyclic disconnection and the girth
- A family of bipartite circulant tournaments with acyclic disconnection 3
- Decycling bipartite tournaments by deleting arcs.
- Bounds on the acyclic disconnection of a digraph
- The connection of the acyclic disconnection and feedback arc sets -- on an open problem of Figueroa et al..
- Competitively orientable complete multipartite graphs
- Bounds on the disparity and separation of tournament solutions
- The minimum feedback arc set problem and the acyclic disconnection for graphs
This page was built for publication: On the acyclic disconnection of multipartite tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q427897)