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: | |
|---|---|
| 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!
|
| Summary: | 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 graphs without noninduced 5-cycles (2010 Mathematics Subject Classification: 05C15, 05C20). |
|---|---|
| ISSN: | 2314-4629 2314-4785 |