Edge choosability of planar graphs without 5-cycles with a chord |
| |
Authors: | Yongzhu Chen |
| |
Affiliation: | Department of Mathematics, Zhejiang Normal University, Jinhua 321004, China |
| |
Abstract: | ![]() Let G be a plane graph having no 5-cycles with a chord. If either Δ≥6, or Δ=5 and G contains no 4-cycles with a chord or no 6-cycles with a chord, then G is edge-(Δ+1)-choosable, where Δ denotes the maximum degree of G. |
| |
Keywords: | Plane graph Edge choosability Cycle Chord |
本文献已被 ScienceDirect 等数据库收录! |
|