scientific article; zbMATH DE number 1463410

MaRDI QIDQ4487469zbMATH OpenFDO

Authors G. Gutin, A. Yeo

Publication date 3 December 2000

zbMATH Keywords

Hamiltonian pathsmultipartite digraphspath covering number

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs
• scientific article; zbMATH DE number 1334635
• Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian
• The ratio of the longest cycle and longest path in semicomplete multipartite digraphs

Cited in

(10)

• Complementary cycles in regular multipartite tournaments, where one cycle has length five
• Complementary cycles in irregular multipartite tournaments
• All regular multipartite tournaments that are cycle complementary
• Paths with a given number of vertices from each partite set in regular multipartite tournaments
• Complementary cycles in almost regular multipartite tournaments, where one cycle has length four
• Multipartite tournaments: a survey
• Cycles with a given number of vertices from each partite set in regular multipartite tournaments
• scientific article; zbMATH DE number 867679 (Why is no real title available?)
• A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs
• Longest cycles in almost regular 3-partite tournaments

This page was built for publication:

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