Open AccessPlanar Graphs of Maximum Degree 6 and without Adjacent 8-Cycles Are 6-Edge-Colorable
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/3562513
Subject(s) - mathematics , degree (music) , combinatorics , planar graph , graph , class (philosophy) , planar , enhanced data rates for gsm evolution , discrete mathematics , computer science , computer graphics (images) , artificial intelligence , physics , acoustics
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom