Note on the existence of directed (k + 1)-cycles in diconnected completek-partite digraphs

DOI10.1002/JGT.3190080310zbMath0545.05037OpenAlexW2145278938MaRDI QIDQ3335811

R. Balakrishnan, P. Paulraja

Publication date: 1984

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190080310

zbMATH Keywords

strongly connecteddirected cyclescomplete partite digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Multipartite tournaments: a survey ⋮ When \(n\)-cycles in \(n\)-partite tournaments are longest cycles

Cites Work

• Unnamed Item

This page was built for publication: Note on the existence of directed (k + 1)-cycles in diconnected completek-partite digraphs