𝔖 Bobbio Scriptorium
✦   LIBER   ✦

No antitwins in minimal imperfect graphs

✍ Scribed by Stephan Olariu

Book ID
107884273
Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
132 KB
Volume
45
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Antitwins in partitionable graphs
Antitwins in partitionable graphs
✍ FrΓ©dΓ©ric Maffray πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 240 KB
On transversals in minimal imperfect gra
On transversals in minimal imperfect graphs
✍ Jean-Luc Fouquet; FrΓ©dΓ©ric Maire; Irena Rusu; Henri Thuillier πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 885 KB

proved that no minimal imperfect graph has a small transversal, that is, a set of vertices of cardinality at most x + M-1 which meets every c+clique and every x-stable set. In this paper we prove that a slight generalization of this notion of small transversal leads to a conjecture which is as stro

On Critical Edges in Minimal Imperfect G
On Critical Edges in Minimal Imperfect Graphs
✍ AndrΓ‘s Sebő πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 725 KB

An edge of a graph is called critical, if deleting it the stability number of the graph increases, and a nonedge is called co-critical, if adding it to the graph the size of the maximum clique increases. We prove in this paper, that the minimal imperfect graphs containing certain configurations of t

About Skew Partitions in Minimal Imperfe
About Skew Partitions in Minimal Imperfect Graphs
✍ F. Roussel; P. Rubio πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 188 KB

V. Chva tal conjectured in 1985 that a minimal imperfect graph G cannot have a skew cutset (i.e., a cutset S decomposable into disjoint sets A and B joined by all possible edges). We prove here the conjecture in the particular case where at least one of A and B is a stable set. 2001 Elsevier Science