𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the average degree of critical graphs with maximum degree six

✍ Scribed by Lianying Miao; Jibin Qu; Qingbo Sun

Book ID
113567365
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
186 KB
Volume
311
Category
Article
ISSN
0012-365X

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

The size of edge chromatic critical grap
The size of edge chromatic critical graphs with maximum degree 6
✍ Rong Luo; Lianying Miao; Yue Zhao πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 216 KB πŸ‘ 1 views

## Abstract In 1968, Vizing [Uaspekhi Mat Nauk 23 (1968) 117–134; Russian Math Surveys 23 (1968), 125–142] conjectured that for any edge chromatic critical graph ${{G}} = ({{V}}, {{E}})$ with maximum degree $\Delta$, $|{{E}}| \geq {{{1}}\over {{2}}}\{(\Delta {{- 1}})|{{V}}| + {{3}}\}$. This conject