On the path covering number of given subdigraphs of regular multipartite tournaments

zbMATH Open1202.05058MaRDI QIDQ3567495FDOQ3567495

Authors: Lutz Volkmann, Stefan Winzen 

Publication date: 17 June 2010

Recommendations

• Paths with a given number of vertices from each partite set in regular multipartite tournaments
• How close to regular must a multipartite tournament be to secure a given path covering number?
• Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments
• Cycles with a given number of vertices from each partite set in regular multipartite tournaments
• Almost regular multipartite tournaments containing a Hamiltonian path through a given arc

zbMATH Keywords

multipartite tournamentspath covering numberregular multipartite tournaments

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)

Cited In (5)

• Paths with a given number of vertices from each partite set in regular multipartite tournaments
• Title not available (Why is that?)
• How close to regular must a multipartite tournament be to secure a given path covering number?
• Multipartite tournaments: a survey
• Covering relations, closest orderings and Hamiltonian bypaths in tournaments

This page was built for publication: On the path covering number of given subdigraphs of regular multipartite tournaments

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