Open AccessList Edge Colorings of Planar Graphs with 7-cycles Containing at Most Two Chords
Author(s) -
Wenwen Zhang
Publication year - 2019
Publication title -
applied science and innovative research
Language(s) - English
Resource type - Journals
eISSN - 2474-4980
pISSN - 2474-4972
DOI - 10.22158/asir.v3n2p85
Subject(s) - combinatorics , planar graph , enhanced data rates for gsm evolution , planar , mathematics , graph , outerplanar graph , computer science , pathwidth , telecommunications , computer graphics (images) , line graph
In this paper we prove that if G is a planar graph, and each 7-cycle contains at most two chords, then G is edge-k-choosable, where k = max{8, ?(G) + 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