A Note on Edge-Group Choosability of Planar Graphs without 5-Cycles

Amir Khamseh and Andrei V. Kelarev

Journal of Mathematics, 2020, vol. 2020, 1-4

Abstract: 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).

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2020/4639260.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2020/4639260.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:4639260

DOI: 10.1155/2020/4639260

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().