DOIAbstract
AbstractCombinatorial properties of dependence graphs are considered. In particular, a characterization is given of sets of unlabelled transitive graphs that can be labelled according to a dependence alphabet
AbstractCombinatorial properties of dependence graphs are considered. In particular, a characterization is given of sets of unlabelled transitive graphs that can be labelled according to a dependence alphabet
The study deals with forced P-graphic and P-unigraphic sequences. The work is aimed at solution of p...
AbstractWe point out the use of graph grammars for specifying (generating) languages of dependency g...
This paper considers dependence conditions under which the pairwise uncorrelatedness of the componen...
AbstractCombinatorial properties of dependence graphs are considered. In particular, a characterizat...
Qian J, Dress A, Wang Y. On the dependence polynomial of a graph. European Journal of Combinatorics....
AbstractLet the dependence polynomial of a graph G be 1−c1z+c2z2−c3z3+… where ck is the number of k-...
AbstractThe dependence polynomial PG=PG(z) of a graph G is defined by PG(z)≔∑i=0n(−1)icizi where ci=...
In this note we develop and clarify some of the basic combinatorial properties of the new notion of ...
AbstractA set of vertices in a graph is said to be dependent if it is not independent. Let pk(G) den...
A set of vertices in a graph is said to be dependent if it is not independent. Let p(k)(G) denote th...
Decomposable dependency models possess a number of interesting and useful proper-ties. This paper pr...
AbstractIn this paper we study dependences on a free monoid X* and their relations to strict binary ...
Decomposable dependency models possess a number of interesting and useful properties. This paper pre...
There are several similar, but not identical, definitions of control dependence in the literature. T...
A set X of vertices of a graph is said to be dependent if X is not an independent set. For the graph...
The study deals with forced P-graphic and P-unigraphic sequences. The work is aimed at solution of p...
AbstractWe point out the use of graph grammars for specifying (generating) languages of dependency g...
This paper considers dependence conditions under which the pairwise uncorrelatedness of the componen...
AbstractCombinatorial properties of dependence graphs are considered. In particular, a characterizat...
Qian J, Dress A, Wang Y. On the dependence polynomial of a graph. European Journal of Combinatorics....
AbstractLet the dependence polynomial of a graph G be 1−c1z+c2z2−c3z3+… where ck is the number of k-...
AbstractThe dependence polynomial PG=PG(z) of a graph G is defined by PG(z)≔∑i=0n(−1)icizi where ci=...
In this note we develop and clarify some of the basic combinatorial properties of the new notion of ...
AbstractA set of vertices in a graph is said to be dependent if it is not independent. Let pk(G) den...
A set of vertices in a graph is said to be dependent if it is not independent. Let p(k)(G) denote th...
Decomposable dependency models possess a number of interesting and useful proper-ties. This paper pr...
AbstractIn this paper we study dependences on a free monoid X* and their relations to strict binary ...
Decomposable dependency models possess a number of interesting and useful properties. This paper pre...
There are several similar, but not identical, definitions of control dependence in the literature. T...
A set X of vertices of a graph is said to be dependent if X is not an independent set. For the graph...
The study deals with forced P-graphic and P-unigraphic sequences. The work is aimed at solution of p...
AbstractWe point out the use of graph grammars for specifying (generating) languages of dependency g...
This paper considers dependence conditions under which the pairwise uncorrelatedness of the componen...
Add to ORKG