✦ LIBER ✦

Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree

✍ Scribed by Nathann Cohen; Frédéric Havet

Publisher: Springer Japan
Year: 2011
Tongue: English
Weight: 492 KB
Volume: 27
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-010-1009-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Maximum degree in graphs of diameter 2

✍ Paul Erdös; Siemion Fajtlowicz; Alan J. Hoffman 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 163 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

The linear arboricity of planar graphs o

The linear arboricity of planar graphs of maximum degree seven is four

✍ Jian-Liang Wu; Yu-Wen Wu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 2 views

## Abstract The linear arboricity of a graph __G__ is the minimum number of linear forests which partition the edges of __G__. Akiyama et al. conjectured that $\lceil {\Delta {({G})}\over {2}}\rceil \leq {la}({G}) \leq \lceil {\Delta({G})+{1}\over {2}}\rceil$ for any simple graph __G__. Wu wu prove