Daniel W. Cranston, Sogol Jahanbekam, Douglas B. West
Published 2013-03-13, updated 2013-03-30Version 2
We apply the Discharging Method to prove the 1,2,3-Conjecture and the 1,2-Conjecture for graphs with maximum average degree less than 8/3. Stronger results on these conjectures have been proved, but this is the first application of discharging to them, and the structure theorems and reducibility results are of independent interest.
Comments: 29 pages, 19 figures; same results as earlier version, but revised introduction
On Star 5-Colorings of Sparse Graphs
2-distance list $(Δ+ 3)$-coloring of sparse graphs
Defective and Clustered Colouring of Sparse Graphs
![QR code for arXiv:1303.3198 [math.CO]](http://oss.arxitics.com/images/favicon.svg)