Add to ORKGWe investigate the class of the edge-shelling convex geometries of trees. The edge-shelling convex geometry of a tree is the convex geometry consisting of the sets of edges of the subtrees. For the edge-shelling convex geometry of a tree, the size of the stem of any rooted circuit is two. The class of the edge-shelling convex geometry of a tree is closed under trace operation. We characterize the class of the edge-shelling convex geometry of a tree in terms of trace-minimal forbidden minors. Moreover, the trace-minimal forbidden minors are specified for the class of convex geometries such that the size of any stem is two.
AbstractA coloring of a tree is convex if the vertices that pertain to any color induce a connected ...
A coloring of a tree is convex if the vertices that pertain to any color induce a connected subtree;...
A coloring of the vertices of a graph (Formula presented.) is convex if the vertices receiving a com...
AbstractWe investigate the class of double-shelling convex geometries. A double-shelling convex geom...
Let V be a finite set and a collection of subsets of V. Then is an alignment of V if and only if ...
The concept of convex extendability is introduced to answer the problem of finding the smallest dis...
AbstractA convex geometry is a combinatorial abstract model introduced by Edelman and Jamison which ...
Let T be an unrooted binary tree with n distinctly labelled leaves. Deriving its name from the field...
A coloring of the leaves of a tree T is called convex, if it is possible to give each internal node ...
A coloring of a graph is convex if it induces a partition of the vertices into connected sub-graphs....
AbstractIt is known that a tree convex network is globally consistent if it is path consistent. Howe...
A coloring of the leaves of a tree T is called convex, if it is possible to give each internal node...
We introduce a strong extended formulation of the convex recoloring problem on a tree, which has an ...
Poset geometries are characterized as convex geometries verifying a given property. These geometries...
A coloring of a tree is convex if the vertices that pertain to any color induce a connected subtree;...
AbstractA coloring of a tree is convex if the vertices that pertain to any color induce a connected ...
A coloring of a tree is convex if the vertices that pertain to any color induce a connected subtree;...
A coloring of the vertices of a graph (Formula presented.) is convex if the vertices receiving a com...
AbstractWe investigate the class of double-shelling convex geometries. A double-shelling convex geom...
Let V be a finite set and a collection of subsets of V. Then is an alignment of V if and only if ...
The concept of convex extendability is introduced to answer the problem of finding the smallest dis...
AbstractA convex geometry is a combinatorial abstract model introduced by Edelman and Jamison which ...
Let T be an unrooted binary tree with n distinctly labelled leaves. Deriving its name from the field...
A coloring of the leaves of a tree T is called convex, if it is possible to give each internal node ...
A coloring of a graph is convex if it induces a partition of the vertices into connected sub-graphs....
AbstractIt is known that a tree convex network is globally consistent if it is path consistent. Howe...
A coloring of the leaves of a tree T is called convex, if it is possible to give each internal node...
We introduce a strong extended formulation of the convex recoloring problem on a tree, which has an ...
Poset geometries are characterized as convex geometries verifying a given property. These geometries...
A coloring of a tree is convex if the vertices that pertain to any color induce a connected subtree;...
AbstractA coloring of a tree is convex if the vertices that pertain to any color induce a connected ...
A coloring of a tree is convex if the vertices that pertain to any color induce a connected subtree;...
A coloring of the vertices of a graph (Formula presented.) is convex if the vertices receiving a com...