A Note on Edge-Group Choosability of Planar Graphs without 5-Cycles
This paper is devoted to a study of 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. In this paper, we study an edge-group choosability version of Vizing conjecture for planar graphs without 5-cycles and for planar grap...
Saved in:
Main Author: | Amir Khamseh |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2020-01-01
|
Series: | Journal of Mathematics |
Online Access: | http://dx.doi.org/10.1155/2020/4639260 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
List Edge Colorings of Planar Graphs without Adjacent 7-Cycles
by: Wenwen Zhang
Published: (2021-01-01) -
Equitable choosability of prism graphs
by: Kirsten Hogenson, et al.
Published: (2025-01-01) -
$(I,F)$-partition of planar graphs without cycles of length 4, 6, or 9
by: Yingli Kang, et al.
Published: (2025-01-01) -
On (k,kn-k2-2k-1)-Choosability of n-Vertex Graphs
by: Wongsakorn Charoenpanitseri
Published: (2015-01-01) -
DP-4-Colorability on Planar Graphs Excluding 7-Cycles Adjacent to 4- or 5-Cycles
by: Fan Yang, et al.
Published: (2025-01-01)