Cycles in a tournament with pairwise zero, one or two given vertices in common

DOI10.1016/j.disc.2007.07.018zbMath1131.05053OpenAlexW2054453791MaRDI QIDQ2470442

Nicolas Lichiardopol

Publication date: 14 February 2008

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

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

zbMATH Keywords

diameterdisjoint cyclesconnected tournament

Mathematics Subject Classification ID

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

Cites Work

• Hamiltonian-connected tournaments
• Partitioning vertices of a tournament into independent cycles
• Cycles in digraphs– a survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item