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!
|
_version_ | 1832547140097802240 |
---|---|
author | Amir Khamseh |
author_facet | Amir Khamseh |
author_sort | Amir Khamseh |
collection | DOAJ |
description | 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). |
format | Article |
id | doaj-art-3ade3d6b29704420a86e5bf21892b247 |
institution | Kabale University |
issn | 2314-4629 2314-4785 |
language | English |
publishDate | 2020-01-01 |
publisher | Wiley |
record_format | Article |
series | Journal of Mathematics |
spelling | doaj-art-3ade3d6b29704420a86e5bf21892b2472025-02-03T06:45:53ZengWileyJournal of Mathematics2314-46292314-47852020-01-01202010.1155/2020/46392604639260A Note on Edge-Group Choosability of Planar Graphs without 5-CyclesAmir Khamseh0Department of Mathematics, Kharazmi University, 15719-14911 Tehran, IranThis 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).http://dx.doi.org/10.1155/2020/4639260 |
spellingShingle | Amir Khamseh A Note on Edge-Group Choosability of Planar Graphs without 5-Cycles Journal of Mathematics |
title | A Note on Edge-Group Choosability of Planar Graphs without 5-Cycles |
title_full | A Note on Edge-Group Choosability of Planar Graphs without 5-Cycles |
title_fullStr | A Note on Edge-Group Choosability of Planar Graphs without 5-Cycles |
title_full_unstemmed | A Note on Edge-Group Choosability of Planar Graphs without 5-Cycles |
title_short | A Note on Edge-Group Choosability of Planar Graphs without 5-Cycles |
title_sort | note on edge group choosability of planar graphs without 5 cycles |
url | http://dx.doi.org/10.1155/2020/4639260 |
work_keys_str_mv | AT amirkhamseh anoteonedgegroupchoosabilityofplanargraphswithout5cycles AT amirkhamseh noteonedgegroupchoosabilityofplanargraphswithout5cycles |