𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Antitwins in partitionable graphs

✍ Scribed by Frédéric Maffray

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
240 KB
Volume
112
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recursive generation of partitionable gr
Recursive generation of partitionable graphs
✍ E. Boros; V. Gurvich; S. Hougardy 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB

## Abstract Results of Lovász (1972) and Padberg (1974) imply that partitionable graphs contain all the potential counterexamples to Berge's famous Strong Perfect Graph Conjecture. A recursive method of generating partitionable graphs was suggested by Chvátal, Graham, Perold, and Whitesides (1979).

On uniquely partitionable planar graphs
On uniquely partitionable planar graphs
✍ Peter Mihók; Jozef Bucko; Margit Voigt 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 444 KB

Let ~1,22 ..... ~,; n/>2 be any properties of graphs. A vertex (~L, ~2 ..... J~,,)-partition of a graph G is a partition (V1, l~,...,/7,,) of V(G) such that for each i = 1,2 ..... n the induced subgraph G[Vi] has the property ~i. A graph G is said to be uniquely (~1,~2 ..... ~,)-partitionable if G h