𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Recursive Graphs, Recursive Labelings and Shortest Paths

✍ Scribed by Proskurowski, Andrzej


Book ID
115498767
Publisher
Society for Industrial and Applied Mathematics
Year
1981
Tongue
English
Weight
826 KB
Volume
10
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Shortest paths on dynamic graphs
✍ Giacomo Nannicini; Leo Liberti πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 746 KB
Recursive generation of partitionable gr
✍ 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).

Shortest noncrossing paths in plane grap
✍ Junya Takahashi, Hitoshi Suzuki and Takao Nishizeki πŸ“‚ Article πŸ“… 1996 πŸ› Springer 🌐 English βš– 569 KB