Results 161 to 170 of about 462 (185)
Some of the next articles are maybe not open access.
Chinese Annals of Mathematics Series B, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaoquan Xu, Xu Xiaoquan
exaly +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaoquan Xu, Xu Xiaoquan
exaly +2 more sources
Order, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Order, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Combinatorica, 2010
The main object of the paper is the following operation on trees. Let \(G_2\) be a tree and \(x\) and \(y\) be its vertices such that all interior points of the path \(xy\) (if they exist) have degree \(2\) in \(G_2\). The generalized tree shift (GTS) of \(G_2\) is the tree \(G_1\) obtained from \(G_2\) as follows: let \(z\) be the neighbour of \(y ...
openaire +1 more source
The main object of the paper is the following operation on trees. Let \(G_2\) be a tree and \(x\) and \(y\) be its vertices such that all interior points of the path \(xy\) (if they exist) have degree \(2\) in \(G_2\). The generalized tree shift (GTS) of \(G_2\) is the tree \(G_1\) obtained from \(G_2\) as follows: let \(z\) be the neighbour of \(y ...
openaire +1 more source
Shuffling Posets on Trajectories
2023Choreographies describe possible sequences of interactions among a set of agents. We aim to join two lines of research on choreographies: the use of the shuffle on trajectories operator to design more expressive choreographic languages, and the use of models featuring partial orders, to compactly represent concurrency between agents.
openaire +1 more source
Acta Mathematica Scientia, 1988
The paper shows that a digraph is a posetable digraph if and only if by removing any arc (u,v) from the digraph, the resulting digraph contains no directed path between u and v.
openaire +2 more sources
The paper shows that a digraph is a posetable digraph if and only if by removing any arc (u,v) from the digraph, the resulting digraph contains no directed path between u and v.
openaire +2 more sources
Pseudo effect algebras are algebras over bounded posets
Fuzzy Sets and Systems, 2020Gejza Jenča
exaly
Pseudo Difference Posets and Pseudo Boolean D-Posets
International Journal of Theoretical Physics, 2004Shang Yun, Yun Shang, Yongming Li
exaly
Algebraic structures on double and plane posets
Journal of Algebraic Combinatorics, 2012Loïc Foissy, Foissy Loïc
exaly
D-test spaces and difference posets
Reports on Mathematical Physics, 1994Anatolij Dvurečenskij +1 more
exaly