𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Average Degree in Graph Powers

✍ Scribed by Matt DeVos; Jessica McDonald; Diego Scheide

Book ID
112121100
Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
547 KB
Volume
72
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Local and global average degree in graph
Local and global average degree in graphs and multigraphs
✍ E. Bertram; P. Erds; P. HorΓ‘k; J. Ε irÑň; Z. S. Tuza πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 603 KB

## Abstract A vertex __v__ of a graph __G__ is called __groupie__ if the average degree __t__~__v__~ of all neighbors of __v__ in __G__ is not smaller than the average degree __t__~__G__~ of __G.__ Every graph contains a groupie vertex; the problem of whether or not every simple graph on ≧2 vertice

Improper choosability of graphs and maxi
Improper choosability of graphs and maximum average degree
✍ FrΓ©dΓ©ric Havet; Jean-SΓ©bastien Sereni πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 174 KB

## Abstract Improper choosability of planar graphs has been widely studied. In particular, Ε krekovski investigated the smallest integer __g__~k~ such that every planar graph of girth at least __g__~k~ is __k__‐improper 2‐choosable. He proved [9] that 6 ≀ __g__~1~ ≀ 9; 5 ≀  __g__~2~ ≀ 7; 5 ≀ __g__~3