On the vertices of a 3-partite tournament not in triangles

DOI10.1016/j.disc.2015.05.004zbMath1314.05084OpenAlexW1020718370MaRDI QIDQ2352064

Ana Paulina Figueroa, Rita E. Zuazua, Mika Olsen

Publication date: 29 June 2015

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

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

zbMATH Keywords

\(\vec {C_3}\)-free verticesglobal irregularitytripartite tournaments

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Strong subtournaments and cycles of multipartite tournaments

Cites Work

• The number \(\overrightarrow{C_3}\) of -free vertices on 3-partite tournaments
• Cycles in multipartite tournaments: Results and problems
• Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments
• Multipartite tournaments: a survey
• Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the vertices of a 3-partite tournament not in triangles