List Edge Colorings of Planar Graphs without Adjacent 7-Cycles

Wenwen Zhang and Ghulam Shabbir

Journal of Mathematics, 2021, vol. 2021, 1-6

Abstract: In this paper, we get that G is edge-k-choosable (k=max10,ΔG) for planar graph G without adjacent 7-cycles.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/6695833.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/6695833.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:6695833

DOI: 10.1155/2021/6695833

Access Statistics for this article

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