Results 181 to 190 of about 6,492 (203)
Some of the next articles are maybe not open access.
Order, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Chinese Annals of Mathematics, Series B, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Wenfeng, Xu, Xiaoquan
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Wenfeng, Xu, Xiaoquan
openaire +1 more source
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
The index of Lie poset algebras
Journal of Combinatorial Theory - Series A, 2021Nicholas Mayers, Vincent Coll
exaly
Groups of linear isometries on poset structures
Discrete Mathematics, 2008Marcelo Firer +2 more
exaly
Congruence B -orbits and the Bruhat poset of involutions of the symmetric group
Discrete Mathematics, 2012Yonah Cherniavsky
exaly