Open AccessList Edge Colorings of Planar Graphs without Adjacent 7-Cycles
Author(s) -
Wenwen Zhang
Publication year - 2021
Publication title -
journal of mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.252
H-Index - 13
eISSN - 2314-4785
pISSN - 2314-4629
DOI - 10.1155/2021/6695833
Subject(s) - mathematics , combinatorics , graph , planar graph , planar , discrete mathematics , computer graphics (images) , computer science
In this paper, we get that G is edge- k -choosable ( k = max 10 , Δ G ) for planar graph G without adjacent 7-cycles.