The acyclic and \(\overset\rightarrow C_3\)-free disconnection of tournaments

DOI10.1016/j.disc.2013.06.013zbMath1281.05067OpenAlexW2085586830MaRDI QIDQ393468

José Luis Cosme-Álvarez, Bernardo Llano

Publication date: 23 January 2014

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

Full work available at URL: https://doi.org/10.1016/j.disc.2013.06.013

zbMATH Keywords

tournamentvertex coloring\(\overset\rightarrow C_3\)-free disconnectionacyclic disconnection

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

A family of bipartite circulant tournaments with acyclic disconnection 3

Cites Work

• Unnamed Item
• Circulant tournaments of prime order are tight
• The acyclic disconnection of a digraph
• On the minimum size of tight hypergraphs
• A class of tight circulant tournaments
• Infinite families of tight regular tournaments

This page was built for publication: The acyclic and \(\overset\rightarrow C_3\)-free disconnection of tournaments