Qualitative independence and Sperner problems for directed graphs
✍ Scribed by L Gargano; J Körner; U Vaccaro
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 894 KB
- Volume
- 61
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
This paper deals with the isomorphism problem of directed path graphs and rooted directed path graphs. Both graph classes belong to the class of chordal graphs, and for both classes the relative complexity of the isomorphism problem is yet unknown. We prove that deciding isomorphism of directed path
In Section 1, we survey the existence theorems for a kernel; in Section 2, we discuss a new conjecture which could constitute a bridge between the kernel problems and the perfect graph conjecture. In fact, we believe that a graph is 'quasi-perfect' if and only if it is perfect. ## Proposition 1.1.