Paths with a given number of vertices from each partite set in regular multipartite tournaments
From MaRDI portal
Publication:2433729
Recommendations
- Cycles with a given number of vertices from each partite set in regular multipartite tournaments
- On the path covering number of given subdigraphs of regular multipartite tournaments
- CYCLES THROUGH A GIVEN SET OF VERTICES IN REGULAR MULTIPARTITE TOURNAMENTS
- Outpaths of arcs in almost regular multipartite tournaments
- Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments
Cites work
- Almost regular c-partite tournaments contain a strong subtournament of order c when c 5
- Cycles in bipartite tournaments
- Cycles in multipartite tournaments
- Cycles with a given number of vertices from each partite set in regular multipartite tournaments
- Diconnected Orientations and a Conjecture of Las Vergnas
- Diregularc-partite tournaments are vertex-pancyclic whenc ? 5
- How close to regular must a multipartite tournament be to secure a given path covering number?
- How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
- scientific article; zbMATH DE number 3150485 (Why is no real title available?)
- scientific article; zbMATH DE number 3878956 (Why is no real title available?)
- scientific article; zbMATH DE number 4103112 (Why is no real title available?)
- scientific article; zbMATH DE number 1463410 (Why is no real title available?)
- scientific article; zbMATH DE number 2145367 (Why is no real title available?)
- scientific article; zbMATH DE number 3013308 (Why is no real title available?)
- scientific article; zbMATH DE number 2114688 (Why is no real title available?)
- Kings in semicomplete multipartite digraphs
- On Subtournaments of a Tournament
- One-diregular subgraphs in semicomplete multipartite digraphs
Cited in
(11)- Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments
- Multipartite tournaments: a survey
- Longest path partitions in generalizations of tournaments
- scientific article; zbMATH DE number 5846037 (Why is no real title available?)
- On the path covering number of given subdigraphs of regular multipartite tournaments
- scientific article; zbMATH DE number 3914346 (Why is no real title available?)
- scientific article; zbMATH DE number 1340230 (Why is no real title available?)
- CYCLES THROUGH A GIVEN SET OF VERTICES IN REGULAR MULTIPARTITE TOURNAMENTS
- scientific article; zbMATH DE number 2221999 (Why is no real title available?)
- Path numbers of balanced bipartite tournaments
- The number \(\overrightarrow{C_3}\) of -free vertices on 3-partite tournaments
This page was built for publication: Paths with a given number of vertices from each partite set in regular multipartite tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2433729)