Split graph to linear forest in order to verify the Linear Arboricity Conjecture (LAC). LAC: ceil(∆/2) ≤ la(G) ≤ ceil((∆+1)/2)