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

DOI10.1002/JGT.3190080310MaRDI QIDQ3335811zbMATH OpenOpenAlexFDO

Authors 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

complete partite digraphsdirected cyclesstrongly connected

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• On \(k\)-strong and \(k\)-cyclic digraphs
• A note on short cycles in digraphs
• Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles
• Disjoint directed cycles in directed graphs
• Cycle-factorization of symmetric complete multipartite digraphs

Cites work

• Graph theory with applications

Cited in

(5)

• When n-cycles in n-partite tournaments are longest cycles
• On complete strongly connected digraphs with the least number of 3-cycles
• Multipartite tournaments: a survey
• A characterization of rich \(c\)-partite \((c \geq 7)\) tournaments without \((c + 2)\)-cycles
• Directed cycle k-connectivity of complete digraphs and complete regular bipartite digraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3335811)