𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Critically partitionable graphs, I

✍ Scribed by A.G Thomason

Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
268 KB
Volume
27
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Cayley partitionable graphs
Cayley partitionable graphs
✍ A. PΓ’cher πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 230 KB
Antitwins in partitionable graphs
Antitwins in partitionable graphs
✍ FrΓ©dΓ©ric Maffray πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 240 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
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