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
Comparability Graphs and Digital Topology
โ Scribed by Alain Bretto
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 65 KB
- Volume
- 82
- Category
- Article
- ISSN
- 1077-3142
No coin nor oath required. For personal study only.
โฆ Synopsis
we will give new, simpler and shorter proofs of these results, we will generalize some of them.
๐ SIMILAR VOLUMES
## Abstract Given a set __F__ of digraphs, we say a graph __G__ is a __F__โ__graph__ (resp., __F__\*โ__graph__) if it has an orientation (resp., acyclic orientation) that has no induced subdigraphs isomorphic to any of the digraphs in __F__. It is proved that all the classes of graphs mentioned in
A S? stcmaric ropolo~ical approach to the starch for regukrities In molecular properties has been proposed on the basis of the so-c.~llod Con:prubiiir\_r graphs of isvrncric clnsscs of molecules. It is shown that the ordering of the isomeric benzenoid 11) drowrbuns in the comp.xJbiiit& grqhs coincid