Hoang, C.T. and F. Maffray, On slim graphs, even pairs, and star-cutsets, Discrete Mathematics 105 (1992) 93-102. Meyniel proved that a graph G is perfect if every odd cycle of G with at least five vertices has at least two chords. A slim graph is any graph obtained from a Meyniel graph by removing
Slim graphs
β Scribed by A. Hertz
- Book ID
- 105309494
- Publisher
- Springer Japan
- Year
- 1989
- Tongue
- English
- Weight
- 576 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
EDITORIAL REVIEW: Life sucks, then you die. Period. Unless you're James Stark, a hitman in Hell for eleven years before escaping back up to Hell-on-earth L.A.looking for revenge, absolution . . . love, maybe. But Hell's not through with Stark.Heaven's not either.
In a small sleepy town in south Mississippi, one backwoods southern lawyer has never lost a case. His name is Slim, and his litigating abilities are known far and wide. Slim is a sly gentleman who uses his many talents and connections to always get what he wants. The time is set just after World War
**Private Investigator Chris Honeysett has a relatively simple case on his hands: find Billy the Tramp.** But despite Billyβs regular appearance on the streets of Bath, heβs nowhere to be seen β and no one seems to want to help Honeysett. And then thereβs the ransom case dealing with an art theft a