Partitioning the vertex set of an acyclic directed graph into convex subsets
From MaRDI portal
Publication:583239
zbMATH Open0692.05052MaRDI QIDQ583239
Publication date: 1987
Published in: Automation and Remote Control (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
This page was built for publication: Partitioning the vertex set of an acyclic directed graph into convex subsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q583239)