Infinite families of tight regular tournaments

DOI10.7151/dmgt.1362zbMath1133.05042OpenAlexW2086098818MaRDI QIDQ5443842

Bernardo Llano, Mika Olsen

Publication date: 22 February 2008

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1362

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

A family of bipartite circulant tournaments with acyclic disconnection 3 ⋮ Disproof of a conjecture of Neumann-Lara ⋮ The acyclic and \(\overset\rightarrow C_3\)-free disconnection of tournaments ⋮ On a Conjecture of Víctor Neumann-Lara ⋮ On the acyclic disconnection of multipartite tournaments ⋮ On the acyclic disconnection and the girth

This page was built for publication: Infinite families of tight regular tournaments