✦ LIBER ✦

Cayley partitionable graphs

✍ Scribed by A. Pâcher

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 230 KB
Volume: 5
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80179-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cayley partitionable graphs and near-fac

Cayley partitionable graphs and near-factorizations of finite groups

✍ A. Pêcher 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 277 KB

Antitwins in partitionable graphs

✍ Frédéric Maffray 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 240 KB

Critically partitionable graphs, I

✍ A.G Thomason 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 268 KB

Perfect Graphs, Partitionable Graphs and

Perfect Graphs, Partitionable Graphs and Cutsets

✍ Michele Conforti; Gérard Cornuéjols; Grigor Gasparyan; Kristina Vušković 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 247 KB

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

✍ 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