Add to ORKGArticle dans revue scientifique avec comité de lecture. internationale.International audienceIn this paper, at first we describe a digraph representing all the weak-order extensions of a partially ordered set and algorithms for generating them. Then we present a digraph representing all of the minimal weak-order extensions of a partially ordered set. This digraph also implies generation algorithms. Finally, we prove that the number of weak-order extensions of a partially ordered set is a comparability invariant, whereas the number of minimal weak-order extensions of a partially ordered set is not a comparability invariant
AbstractIn this paper we present a constructive proof of a theorem on minimal decompositions of part...
AbstractWe study complexity problems involving three sorts of combinational structures: cyclic order...
We consider the class of so-called k-quasidiscrete linear orderings, show that every k-quasi-discret...
Article dans revue scientifique avec comité de lecture. internationale.International audienceIn this...
AbstractIn this paper, at first we describe a digraph representing all the weak-order extensions of ...
AbstractIn this paper we introduce a family of ordered sets we call k-weak orders which generalize w...
AbstractA symmetric, antireflexive relation S is a comparability graph if one can assign a transitiv...
AbstractWe consider the problem of characterizing the set ε(P) of all extensions of an order P on a ...
AbstractWe introduce adequate concepts of expansion of a digraph to obtain a sequential construction...
AbstractLet P and Q be (partially) ordered sets with the same comparability graph. A bijection is co...
A given collection of sets has a natural partial order induced by the subset relation. Let the size ...
We study the number of linear extensions of a partial order with a given proportion of comparable pa...
We consider the problem of partial order production: arrange the elements of an unknown totally orde...
AbstractAn undirected graph G is called a comparability graph if there exists an orientation of its ...
AbstractThe linear extension majority (LEM) graph (X, > p) of a finite partially ordered set (X, P) ...
AbstractIn this paper we present a constructive proof of a theorem on minimal decompositions of part...
AbstractWe study complexity problems involving three sorts of combinational structures: cyclic order...
We consider the class of so-called k-quasidiscrete linear orderings, show that every k-quasi-discret...
Article dans revue scientifique avec comité de lecture. internationale.International audienceIn this...
AbstractIn this paper, at first we describe a digraph representing all the weak-order extensions of ...
AbstractIn this paper we introduce a family of ordered sets we call k-weak orders which generalize w...
AbstractA symmetric, antireflexive relation S is a comparability graph if one can assign a transitiv...
AbstractWe consider the problem of characterizing the set ε(P) of all extensions of an order P on a ...
AbstractWe introduce adequate concepts of expansion of a digraph to obtain a sequential construction...
AbstractLet P and Q be (partially) ordered sets with the same comparability graph. A bijection is co...
A given collection of sets has a natural partial order induced by the subset relation. Let the size ...
We study the number of linear extensions of a partial order with a given proportion of comparable pa...
We consider the problem of partial order production: arrange the elements of an unknown totally orde...
AbstractAn undirected graph G is called a comparability graph if there exists an orientation of its ...
AbstractThe linear extension majority (LEM) graph (X, > p) of a finite partially ordered set (X, P) ...
AbstractIn this paper we present a constructive proof of a theorem on minimal decompositions of part...
AbstractWe study complexity problems involving three sorts of combinational structures: cyclic order...
We consider the class of so-called k-quasidiscrete linear orderings, show that every k-quasi-discret...