2 citations · 6 across the 10 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011★ 2 cited
On edge-group choosability of graphs
Amir Khamseh, Gholamreza Omidi
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…
math.CO2011
On group choosability of total graphs
H. J. Lai, G. R. Omidi, G. Raeisi
In this paper, we study the group and list group colorings of total graphs and we give two group versions of the total and list total colorings conjectures. We establish the group…