๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Covering degrees are determined by graph manifolds involved

โœ Scribed by F. Yu; S. Wang


Book ID
105756860
Publisher
European Mathematical Society
Year
1999
Tongue
English
Weight
150 KB
Volume
74
Category
Article
ISSN
0010-2571

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Degree sums and graphs that are not cove
โœ 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