## Abstract A graph __G__ is a (__k, l__)βgraph if for any subgraph __H__ of __G__, that |__V(H)__| β§ implies that k(__H__) β¦ __k__ β 1. An edgeβmaximal (__k, l__βgraph __G__ is one such that for any __e__ Ο΅ __E__(__G__^__c__^), __G__ + __e__ is not a (__k, l__)βgraph. In [F. T. Boesch and J. A. M.
Maxims I, Part I
β Scribed by James W. Earl
- Publisher
- Springer Netherlands
- Year
- 1983
- Tongue
- English
- Weight
- 336 KB
- Volume
- 67
- Category
- Article
- ISSN
- 0028-2677
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In the middle of America, on Route 44, Amy Lewis has a plan β to get to her grandma's house in time for dinner. Galaxies away Loki is waking up in a prison cell, strangely without a hangover, and with no idea what he's done wrong β this time anyway. But he does know Thor is hiding something, Odin is
Ice knows all about rules, perfection and claustrophobia. Daughter of the wealthiest African-American banker in town, she knows that image is everything. Enter Peyton Stone, a sexy troublemaker who seems to live above the rules. He can get whatever girl he wants, but when he takes interest in Ice, w
Goethe's Faust reworks the late-medieval myth of Dr Faust, a brilliant scholar so disillusioned he resolves to make a contract or wager with the devil, Mephistopheles. The devil will do all he asks on Earth and seek to grant him a moment in life so glorious that he will wish it to last for ever. But