We characterize sources in comparability graphs and show that our result provides a unifying look at two recent results about interval graphs. An orientation 0 of a graph G is obtained by assigning unique directions to its
Sources in posets and comparability graphs
β Scribed by John Gimbel
- Publisher
- Springer Netherlands
- Year
- 1992
- Tongue
- English
- Weight
- 229 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0167-8094
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Given two finite posets P and P$ with the same comparability graph, we show that if |V(P)| 4 and if for all x # V(P), P&x & P$&x, then P &P$. This result leads us to characterize the finite posets P such that for all x # V(P), P&x & P\*&x.
## Abstract Usually __dimension__ should be an integer valued parameter. We introduce a refined version of dimension for graphs, which can assume a value [__t__βββ1 β __t__], thought to be between __t__βββ1 and __t__. We have the following two results: (a) a graph is outerplanar if and only if its
we will give new, simpler and shorter proofs of these results, we will generalize some of them.
A notion of parallelism is defined in finite median graphs and a number of properties about geodesics and the existence of cubes are obtained. Introducing sites as a double structure of partial order and graph on a set, it is shown that all median graphs can be constructed from sites and, in fact, t
Order structures such as linear orders, weak orders, semiorders and interval orders are often considered as models of a decision maker's preferences. In this paper we introduce and study new order structures characterized by their symmetric part belonging to certain classes of co-comparability graph