✦ LIBER ✦

On -minors in graphs with given average degree

✍ Scribed by Alexandr Kostochka; Noah Prince

Book ID: 108113891
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 195 KB
Volume: 308
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.08.041

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On -minors in graphs with given average

On -minors in graphs with given average degree, II

✍ A.V. Kostochka; N. Prince 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 210 KB

Large minors in graphs with given indepe

Large minors in graphs with given independence number

✍ József Balogh; A.V. Kostochka 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 303 KB

(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

Counting loopy graphs with given degrees

✍ Catherine Greenhill; Brendan D. McKay 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 455 KB

On the average degree of critical graphs

On the average degree of critical graphs with maximum degree six

✍ Lianying Miao; Jibin Qu; Qingbo Sun 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 186 KB

Average Degree in Graph Powers

✍ Matt DeVos; Jessica McDonald; Diego Scheide 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 547 KB