scientific article
From MaRDI portal
Publication:3691764
zbMath0573.05031MaRDI QIDQ3691764
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (28)
Finding good 2-partitions of digraphs. I. Hereditary properties ⋮ On complementary cycles in locally semicomplete digraphs ⋮ Finding good 2-partitions of digraphs. II. Enumerable properties ⋮ Complementary cycles in regular bipartite tournaments ⋮ Complementary cycles of any length in regular bipartite tournaments ⋮ Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang conjecture ⋮ Safe sets and in-dominating sets in digraphs ⋮ Complementary cycles in almost regular multipartite tournaments, where one cycle has length four ⋮ Minimum cycle factors in quasi-transitive digraphs ⋮ Weakly cycle complementary 3-partite tournaments ⋮ Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz ⋮ Multipartite tournaments: a survey ⋮ Cycles in a tournament with pairwise zero, one or two given vertices in common ⋮ Componentwise complementary cycles in multipartite tournaments ⋮ On the structure of locally semicomplete digraphs ⋮ Cycle factors in strongly connected local tournaments ⋮ All 2-connected in-tournaments that are cycle complementary ⋮ Three supplements to Reid's theorem in multipartite tournaments ⋮ Finding complementary cycles in locally semicomplete digraphs ⋮ The partition of a strong tournament ⋮ Degree constrained 2-partitions of semicomplete digraphs ⋮ On 1-factors with prescribed lengths in tournaments ⋮ Complementary cycles in irregular multipartite tournaments ⋮ Complementary cycles in regular multipartite tournaments, where one cycle has length five ⋮ All regular multipartite tournaments that are cycle complementary ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs ⋮ Tournaments and Semicomplete Digraphs ⋮ Partitioning vertices of a tournament into independent cycles
This page was built for publication:
