On the acyclic disconnection of multipartite tournaments

DOI10.1016/J.DAM.2012.03.008zbMATH Open1243.05093OpenAlexW2072920905MaRDI QIDQ427897FDOQ427897

Authors: Bernardo Llano, M. Olsen, E. Rivera-Campo, A. P. Figueroa 

Publication date: 18 June 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.03.008

Recommendations

• A family of bipartite circulant tournaments with acyclic disconnection 3
• On the acyclic disconnection and the girth
• The acyclic disconnection of a digraph
• The acyclic and \(\overset\rightarrow C_3\)-free disconnection of tournaments
• Decycling bipartite tournaments by deleting arcs.

zbMATH Keywords

acyclic disconnectionmultipartite tournamentsregular bipartite tournaments

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Connectivity (05C40)

Cites Work

• Digraphs
• The dichromatic number of a digraph
• Retracts of strong products of graphs
• The acyclic disconnection of a digraph
• A class of tight circulant tournaments
• Infinite families of tight regular tournaments
• Circulant tournaments of prime order are tight
• Dichromatic number, circulant tournaments and Zykov sums of digraphs
• On a Conjecture of Víctor Neumann-Lara

Cited In (13)

• On high-dimensional acyclic tournaments
• The acyclic and \(\overset\rightarrow C_3\)-free disconnection of tournaments
• Acyclic sets in \(k\)-majority tournaments
• Solution of a conjecture of Vandell on decycling bipartite tournaments by deleting arcs
• Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments
• 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)