The number \(\overrightarrow{C_3}\) of -free vertices on 3-partite tournaments

DOI10.1016/j.disc.2010.06.006zbMath1213.05111OpenAlexW2090802004MaRDI QIDQ708413

Bernardo Llano, Ana Paulina Figueroa, Rita E. Zuazua

Publication date: 11 October 2010

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

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

zbMATH Keywords

directed triangle free vertexregular 3-partite tournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On multipartite tournaments
• On cycles in multipartite tournaments
• Cycles in multipartite tournaments
• Cycles in multipartite tournaments: Results and problems
• Extendable cycles in multipartite tournaments
• Multipartite tournaments: a survey
• Diconnected Orientations and a Conjecture of Las Vergnas
• Diregularc-partite tournaments are vertex-pancyclic whenc ? 5

This page was built for publication: The number \(\overrightarrow{C_3}\) of -free vertices on 3-partite tournaments