CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS (Q5696977): Difference between revisions

@@ Property / cites work @@
+On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
+Normal rank
@@ Property / cites work @@
+Alternative Markov Properties for Chain Graphs
@@ Property / cites work: Alternative Markov Properties for Chain Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4382293
@@ Property / cites work: Q4382293 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3997653
@@ Property / cites work: Q3997653 / rank @@
+Normal rank
@@ Property / cites work @@
+A recovery algorithm for chain graphs
@@ Property / cites work: A recovery algorithm for chain graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Characterization of Inclusion Neighbourhood in Terms of the Essential Graph: Upper Neighbours
+Normal rank
@@ Property / cites work @@
+A graphical characterization of the largest chain graphs
+Normal rank