Planar Graphs of Maximum Degree 6 and without Adjacent 8-Cycles Are 6-Edge-Colorable

Wenwen Zhang and M. M. Bhatti

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

Abstract: In this paper, by applying the discharging method, we show that if G is a planar graph with a maximum degree of Δ=6 that does not contain any adjacent 8-cycles, then G is of class 1.

Date: 2021
References: Add references at CitEc
Citations:

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

DOI: 10.1155/2021/3562513

Access Statistics for this article

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