Convexity in directed graphs
From MaRDI portal
Publication:2532579
DOI10.1016/0095-8956(71)90074-8zbMath0174.26803OpenAlexW2000304287MaRDI QIDQ2532579
Publication date: 1971
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(71)90074-8
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items (11)
Closure lattices ⋮ A new notion of convexity in digraphs with an application to Bayesian networks ⋮ Semihomomorphisms of Semimodular Lattices ⋮ Partition coefficients of acyclic graphs ⋮ On two-path convexity in multipartite tournaments ⋮ Decision systems in rough set theory: A set operatorial perspective ⋮ ULD-Lattices and Δ-Bonds ⋮ Transformations of discrete closure systems ⋮ Closure spaces that are not uniquely generated ⋮ A graph theoretic approach to the investigation of system‐environment relationships† ⋮ Join-semidistributive lattices and convex geometries.
Cites Work
This page was built for publication: Convexity in directed graphs
