𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note onZ3-connected graphs with degree sum condition

✍ Scribed by Xin Min Hou

Book ID
118792085
Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2012
Tongue
English
Weight
227 KB
Volume
28
Category
Article
ISSN
1439-7617

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__~__

Connected subgraphs with small degree su
Connected subgraphs with small degree sums in 3-connected planar graphs
✍ Enomoto, Hikoe; Ota, Katsuhiro πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 213 KB πŸ‘ 2 views

It is well-known that every planar graph has a vertex of degree at most five. Kotzig proved that every 3-connected planar graph has an edge xy such that deg(x) + deg(y) ≀ 13. In this article, considering a similar problem for the case of three or more vertices that induce a connected subgraph, we sh