𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On -minors in graphs with given average degree, II

✍ Scribed by A.V. Kostochka; N. Prince

Book ID
118735027
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
210 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

(d,1)-total labeling of graphs with a gi
(d,1)-total labeling of graphs with a given maximum average degree
✍ MickaΓ«l Montassier; AndrΓ© Raspaud πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 166 KB πŸ‘ 1 views

## Abstract The (__d__,1)‐total number $\lambda \_{d}^{T}(G)$ of a graph __G__ is the width of the smallest range of integers that suffices to label the vertices and the edges of __G__ so that no two adjacent vertices have the same color, no two incident edges have the same color, and the distance

On the independent domination number of
On the independent domination number of graphs with given minimum degree
✍ N.I. Glebov; A.V. Kostochka πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 175 KB

We prove a new upper bound on the independent domination number of graphs in terms of the number of vertices and the minimum degree. This bound is slightly better than that of Haviland (1991) and settles the case 6 = 2 of the corresponding conjecture by Favaron (1988). @ 1998 Elsevier Science B.V. A