Amir Khamseh, Gholamreza Omidi
Published 2011-06-06Version 1
In this paper, we study the concept of edge-group choosability of graphs. We say that G is edge k-group choosable if its line graph is k-group choosable. An edge-group choosability version of Vizing conjecture is given. The evidence of our claim are graphs with maximum degree less than 4, planar graphs with maximum degree at least 11, planar graphs without small cycles, outerplanar graphs and near-outerplanar graphs.
The Treewidth of Line Graphs
On clique immersions in line graphs
The hamiltonicity of essentially 9-connected line graphs
![QR code for arXiv:1106.1110 [math.CO]](http://oss.arxitics.com/images/favicon.svg)