Edge-group choosability of outerplanar and near-outerplanar graphs

As a straightforward consequence, every K2,3-minor-free graph G or every K4-minor-free graph G is edge-(D(G)+1)-group choosable. Moreover, it is proved that if G is an outerplanar graph with maximum degree D≥5, then χ′gl(G)≤D.