3 citations · 5 across the 16 of their papers we have counts for
19 papers
Gallai Decomposition of Ordered Groups: Subgroups, Quotients, and the -free Case
Imed Zaguia
We study Gallai decomposition for groups equipped with two-sided invariant partial orders. The key algebraic step extends to arbitrary binary relations compatible with the group op…
Cops and Robbers, Clique Covers, and Induced Cycles
Alexander Clow, Imed Zaguia
We consider the Cops and Robbers game played on finite simple graphs. In a graph , the number of cops required to capture a robber in the Cops and Robbers game is denoted by $c(…
The structure of interval orders with no infinite antichain
Maurice Pouzet, Imed Zaguia
We prove that if is a nonprime graph with either no infinite independent set or no infinite clique, then every vertex of belongs to a maximal strong module distinct f…
The Aharoni--Korman conjecture for posets whose incomparability graph is locally finite
Imed Zaguia
Aharoni and Korman (Order 9 (1992) 245--253) have conjectured that every ordered set without infinite antichains possesses a chain and a partition into antichains so that each part…
Minimal prime ages, words and permutation graphs
Djamila Oudrar, Maurice Pouzet, Imed Zaguia
This paper is a contribution to the study of hereditary classes of finite graphs. We classify these classes according to the number of prime structures they contain. We consider su…
Minimal prime ages, words and permutation graphs Extended abstract
Djamila Oudrar, Maurice Pouzet, Imed Zaguia
This paper is a contribution to the study of hereditary classes of finite graphs. We classify these classes according to the number of prime structures they contain. We consider su…
Hereditary classes of ordered sets of width at most two
Maurice Pouzet, Imed Zaguia
This paper is a contribution to the study of hereditary classes of relational structures, these classes being quasi-ordered by embeddability. It deals with the specific case of ord…
Metric properties of incomparability graphs with an emphasis on paths
Maurice Pouzet, Imed Zaguia
We describe some metric properties of incomparability graphs. We consider the problem of the existence of infinite paths, either induced or isometric, in the incomparability graph…
Permutations Avoiding Certain Partially-ordered Patterns
Kai Ting Keshia Yap, David Wehlau, Imed Zaguia
A permutation contains a pattern if and only if there is a subsequence in with its letters are in the same relative order as those in . Partially ordered patterns (P…
Graphs containing finite induced paths of unbounded length
Maurice Pouzet, Imed Zaguia
The age of a graph (undirected and without loops) is the collection of finite induced subgraphs of , considered up to isomorphy and ordered by embeddability…
Greedy balanced pairs in -free ordered sets
Imed Zaguia
An -greedy balanced pair in an ordered set is a pair of elements of such that the proportion of greedy linear extensions of that put before …
The Aharoni--Korman conjecture for -free posets with no infinite antichain
Imed Zaguia
We give a necessary and sufficient condition for a -free graph to be a cograph. This allows us to obtain a simple proof of the fact that finite -free graphs are finite co…
Interval orders, semiorders and ordered groups
Maurice Pouzet, Imed Zaguia
We prove that the order of an ordered group is an interval order if and only if it is a semiorder. Next, we prove that every semiorder is isomorphic to a collection of…
Iterated Arc Graphs
Danny Rorabaugh, Claude Tardif, David Wehlau +1
The arc graph of a digraph is the digraph with the set of arcs of as vertex-set, where the arcs of join consecutive arcs of . In 1981, Poljak and Rödl char…
The 1/3-2/3 Conjecture for ordered sets whose cover graph is a forest
Imed Zaguia
A balanced pair in an ordered set is a pair of elements of such that the proportion of linear extensions of that put before is in the real inte…
Pairs of orthogonal countable ordinals
Claude Laflamme, Maurice Pouzet, Nobert Sauer +1
We characterize pairs of orthogonal countable ordinals. Two ordinals and are orthogonal if there are two linear orders and on the same set with order types …
Some inequalities for orderings of acyclic digraphs
Thomas Bier, Imed Zaguia
Let be an acyclic digraph. For define to be the difference of the indegree and the outdegree of . An acyclic ordering of the vertices of is…
The 1/3-2/3 conjecture for -free ordered sets
Imed Zaguia
A balanced pair in a finite ordered set is a pair of elements of such that the proportion of linear extensions of that put before is in the rea…
On minimal prime graphs and posets
Maurice Pouzet, Imed Zaguia
We show that there are four infinite prime graphs such that every infinite prime graph with no infinite clique embeds one of these graphs. We derive a similar result for infinite p…