Document Type

Article

Publication Date

1988

DOI

10.1016/0095-8956(88)90071-8

Publication Title

Journal of Combinatorial Theory, Series B

Volume

45

Issue

2

Pages

255-257

Abstract

It is customary to call vertices x and y twins if every vertex distinct from x and y is adjacent either to both of them or to neither of them. By analogy, we shall call vertices x and yantitwins if every vertex distinct from x and y is adjacent to precisely one of them. Lovász proved that no minimal imperfect graph has twins. The purpose of this note is to prove the analogous statement for antitwins.

Comments

Elsevier open archive. Copyright © 1988 Published by Elsevier Inc. All rights reserved.

Original Publication Citation

Olariu, S. (1988). No antitwins in minimal imperfect graphs. Journal of Combinatorial Theory, Series B, 45(2), 255-257. doi:10.1016/0095-8956(88)90071-8

ORCID

0000-0002-3776-216X (Olariu)

Download

Share

COinS