Title of article
Edge-group choosability of outerplanar and near-outerplanar graphs
Author/Authors
Khamseh, Amir Department of Mathematics - Kharazmi University, Tehran, Iran
Pages
6
From page
211
To page
216
Abstract
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.
Keywords
List coloring , Group choosability , Edge-group choosability
Journal title
Transactions on Combinatorics
Serial Year
2020
Record number
2605273
Link To Document