Let G be a 2-edge-connected simple graph on n > 95 vertices. Let 1 be the number of vertices of degree 2 in G. We prove that if I < n/5 -19 and if, for every edge uveE(G), d(u) + d(v) > 2n/5 -2, then exactly one of the following holds: (a) G has a spanning closed trail; (b) G can be contracted to
Spanning trails
β Scribed by Paul A. Catlin
- Publisher
- John Wiley and Sons
- Year
- 1987
- Tongue
- English
- Weight
- 264 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Suppose __G__ is a simple connected __n__βvertex graph. Let Ο~3~(__G__) denote the minimum degree sum of three independent vertices in __G__ (which is β if __G__ has no set of three independent vertices). A 2β__trail__ is a trail that uses every vertex at most twice. Spanning 2βtrails g
Let T be a trail of a graph G. T is a spanning trail (S-trail) if T contains all vertices of G. Tis a dominating trail (D-trail) if every edge of G is incident with a t least one vertex of T. A circuit is a nontrivial closed trail. Sufficient conditions involving lower bounds on the degree-sum of v
Kalinda Marsh, the toast of the internet, soon found out how quickly web based fame can become a nasty reality. Needing a fresh start, she answered an ad for a mail order bride for an Oregonian Outfitter in need of a wife with internet marketing skills. Paul, a member of an old Oregonian family, b
**She refuses to believe in love. Heβs never wanted anything so bad.** Hannah canβt believe sheβs lost so much in her short life. Losing her parents then her sister-in-law and then finally her brother broke her dreams of ever finding happiness. Watching as each member of her family finds happy-ev
He was a rogue element, disobeying orders and pursuing mission goals of his own. His Scout Team had been burned, disavowed by his chain of command and the owner of the stolen ship he was flying was after them to get it back. To make matters even more complicated, the man Jacob had stolen the ship fr