(a, b)-decomposition

• Every planar graph is F(2, 4)-decomposable. • Every planar graph G with girth at least g is • F(2, 0)-decomposable if g \ge 4. • (1, 4)-decomposable if g \ge 5. • F(1, 2)-decomposable if g \ge 6. • F(1, 1)-decomposable if g \ge 8, or if every cycle of G is either a triangle or a cycle with at least 8 edges not belonging to a triangle. • (1, 5)-decomposable if G has no 4-cycles. • Every outerplanar graph is F(2, 0)-decomposable == Notes ==