Publication:3828034
From MaRDI portal
zbMath0674.05047MaRDI QIDQ3828034
Publication date: 1988
Related Items
Minimum cycle factors in quasi-transitive digraphs, A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian, Hamiltonian paths containing a given arc, in almost regular bipartite tournaments, Independent sets and non-augmentable paths in generalizations of tournaments, Paths with a given number of vertices from each partite set in regular multipartite tournaments, Multipartite tournaments: a survey, Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs, Longest path partitions in generalizations of tournaments