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

The number of incomplete colorings of the vertices of a graph

โœ Scribed by Kh. N. Narzullaev

Publisher
Springer US
Year
1972
Tongue
English
Weight
135 KB
Volume
4
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the number of vertices of given degre
On the number of vertices of given degree in a random graph
โœ Zbigniew Palka ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 115 KB ๐Ÿ‘ 1 views

This note can be treated a s a supplement to a paper written by Bollobas which was devoted to the vertices of a given degree in a random graph. We determine some values of the edge probability p for which the number of vertices of a given degree of a random graph G E ?An, p) asymptotically has a nor

The number of cut-vertices in a graph of
The number of cut-vertices in a graph of given minimum degree
โœ Michael O. Albertson; David M. Berman ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 228 KB

Albertson, M.O. and D.M. Berman, The number of cut-vertices in a graph of given minimum degree, Discrete Mathematics 89 (1991) 97-100. A graph with n vertices and minimum degree k 2 2 can contain no more than (2k -2)n/(kz -2) cut-vertices. This bound is asymptotically tight. \* Research supported in