Tough spiders
✍ Scribed by Tomáš Kaiser; Daniel Král; Ladislav Stacho
- Publisher
- John Wiley and Sons
- Year
- 2007
- Tongue
- English
- Weight
- 252 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
Spider graphs are the intersection graphs of subtrees of subdivisions of stars. Thus, spider graphs are chordal graphs that form a common superclass of interval and split graphs. Motivated by previous results on the existence of Hamilton cycles in interval, split and chordal graphs, we show that every 3/2‐tough spider graph is hamiltonian. The obtained bound is best possible since there are (3/2 – ε)‐tough spider graphs that do not contain a Hamilton cycle. © 2007 Wiley Periodicals, Inc. J Graph Theory 56: 23–40, 2007
📜 SIMILAR VOLUMES
Sam is concerned about keeping things orderly and "cool" at school. She thinks people need to have a tough skin in order to fit in and withstand others' meanness and lack of cooperation. Sam teases her free-spirited classmate Luisa and enlists a friend, Jayla, to help. But when Sam is confronted by
Tough Enough gets into so much mischief he is suspected of being a chicken thief, but the little dog proves his loyalty by warning Beanie and his sister of a flood while father catches the real thief, a chicken hawk.
Mitch Carter's a hard man. He's clawed his way up from Buffalo's gutter through a combination of ruthlessness and stark loyalty to become the King of Prospect Avenue. But when he sees lovely Tessa Verdun, a crack appears in his tough veneer. He wants her for his wife even if making it happen require