The competition hypergraphs of doubly partial orders
نویسندگان
چکیده
Since Cho and Kim [2] had shown that the competition graph of a doubly partial order is an interval graph, it has been actively studied whether or not the same phenomenon occurs for other variants of competition graph and interesting results have been obtained. Continuing in the same spirit, we study the competition hypergraph, an interesting variant of competition graph, of a doubly partial order. Though it turns out that the competition hypergraph of a doubly partial order is not always interval, we completely characterize the competition hypergraphs of doubly partial orders which are interval.
منابع مشابه
On competition graphs of n-tuply partial orders
Studying competition graphs of interesting digraphs is a basic open problem in the study of competition graphs. In this context, Cho and Kim [1] studied competition graphs of doubly partial orders and gave a nice characterization of the competition graphs of doubly partial orders. In this paper, we extend their results to a general case, which turns out to be quite interesting. Especially, we t...
متن کاملThe niche graphs of doubly partial orders
The competition graph of a doubly partial order is known to be an interval graph. The competition-common enemy graph of a doubly partial order is also known to be an interval graph unless it contains a cycle of length 4 as an induced subgraph. In this paper, we show that the niche graph of a doubly partial order is not necessarily an interval graph. In fact, we prove that, for each n ≥ 4, there...
متن کاملA class of acyclic digraphs with interval competition graphs
Let D be an acyclic digraph. The competition graph of D has the same set of vertices as D and an edge between vertices u and v if and only if there is a vertex x in D such that (u, x) and (v, x) are arcs of D. In this paper, we show that the competition graphs of doubly partial orders are interval graphs. We also show that an interval graph together with enough isolated vertices is the competit...
متن کاملThe phylogeny graphs of double partial orders
The competition graph of a doubly partial order is known to be an interval graph. The CCE graph and the niche graph of a doubly partial order are also known to be interval graphs if the graphs do not contain a cycle of length four and three as an induced subgraph, respectively. Phylogeny graphs are variant of competition graphs. The phylogeny graph P (D) of a digraph D is the (simple undirected...
متن کاملOrder Transitive oriented 3-hypergraphs of cyclic orders
In this paper we introduce the definition of transitivity for oriented $3$--hypergraphs in order to study partial and complete cyclic orders. This definition allow us to give sufficient conditions on a partial cyclic order to be totally extendable. Furthermore, we introduce the $3$-hypergraph associated to a cyclic permutation and characterize it in terms of cyclic comparability $3$-hypergraphs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 165 شماره
صفحات -
تاریخ انتشار 2014