𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A degree sum condition for graphs to be covered by two cycles

✍ Scribed by Shuya Chiba; Masao Tsugaki

Book ID
108114219
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
457 KB
Volume
310
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A degree sum condition for longest cycle
A degree sum condition for longest cycles in 3-connected graphs
✍ Tomoki Yamashita πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 110 KB πŸ‘ 1 views

## Abstract For a graph __G__, we denote by __d__~__G__~(__x__) and ΞΊ(__G__) the degree of a vertex __x__ in __G__ and the connectivity of __G__, respectively. In this article, we show that if __G__ is a 3‐connected graph of order __n__ such that __d__~__G__~(__x__) + __d__~__G__~(__y__) + __d__~__

Degree sums and graphs that are not cove
Degree sums and graphs that are not covered by two cycles
✍ Saito, Akira πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 127 KB πŸ‘ 2 views

For a graph G, let Οƒ 3 (G) = min{deg G x + deg G y + deg G z: {x, y, z} is an independent set in G}. Enomoto et al. [Enowoto et al., J Graph Theory 20 (1995), 419-422] have proved that the vertex set of a 2-connected graph G of order n with Οƒ 3 (G) β‰₯ n is covered by two cycles, edges or vertices. Ex

Ore-type degree conditions for a graph t
Ore-type degree conditions for a graph to be H-linked
✍ Alexandr V. Kostochka; Gexin Yu πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 155 KB πŸ‘ 1 views

## Abstract Given a fixed multigraph __H__ with __V__(__H__) = {__h__~1~,…, __h__~m~}, we say that a graph __G__ is __H__‐linked if for every choice of __m__ vertices __v__~1~, …, ~v~~m~ in __G__, there exists a subdivision of __H__ in __G__ such that for every __i__, __v__~i~ is the branch vertex