On the acyclic disconnection of multipartite tournaments

DOI10.1016/j.dam.2012.03.008zbMath1243.05093OpenAlexW2072920905MaRDI QIDQ427897

Bernardo Llano, Eduardo Rivera-Campo, Mika Olsen, Ana Paulina 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

zbMATH Keywords

multipartite tournamentsacyclic disconnectionregular bipartite tournaments

Mathematics Subject Classification ID

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

Related Items

Competitively orientable complete multipartite graphs, A family of bipartite circulant tournaments with acyclic disconnection 3, The minimum feedback arc set problem and the acyclic disconnection for graphs, Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments, On the acyclic disconnection and the girth

Cites Work

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