List Edge Colorings of Planar Graphs without Adjacent 7-Cycles

List Edge Colorings of Planar Graphs without Adjacent 7-Cycles

In this paper, we get that G is edge-k-choosable (k=max10,ΔG) for planar graph G without adjacent 7-cycles.

Bibliographic Details
Main Author: Wenwen Zhang
Format: Article
Language:English
Published: Hindawi Limited 2021-01-01
Series:Journal of Mathematics
Online Access:http://dx.doi.org/10.1155/2021/6695833
id doaj-252ebda5b70a40888c355c4d1152d552
record_format Article
spelling doaj-252ebda5b70a40888c355c4d1152d5522021-04-26T00:03:34ZengHindawi LimitedJournal of Mathematics2314-47852021-01-01202110.1155/2021/6695833List Edge Colorings of Planar Graphs without Adjacent 7-CyclesWenwen Zhang0School of Date and Computer ScienceIn this paper, we get that G is edge-k-choosable (k=max10,ΔG) for planar graph G without adjacent 7-cycles.http://dx.doi.org/10.1155/2021/6695833
collection DOAJ
language English
format Article
sources DOAJ
author Wenwen Zhang
spellingShingle Wenwen Zhang
List Edge Colorings of Planar Graphs without Adjacent 7-Cycles
Journal of Mathematics
author_facet Wenwen Zhang
author_sort Wenwen Zhang
title List Edge Colorings of Planar Graphs without Adjacent 7-Cycles
title_short List Edge Colorings of Planar Graphs without Adjacent 7-Cycles
title_full List Edge Colorings of Planar Graphs without Adjacent 7-Cycles
title_fullStr List Edge Colorings of Planar Graphs without Adjacent 7-Cycles
title_full_unstemmed List Edge Colorings of Planar Graphs without Adjacent 7-Cycles
title_sort list edge colorings of planar graphs without adjacent 7-cycles
publisher Hindawi Limited
series Journal of Mathematics
issn 2314-4785
publishDate 2021-01-01
description In this paper, we get that G is edge-k-choosable (k=max10,ΔG) for planar graph G without adjacent 7-cycles.
url http://dx.doi.org/10.1155/2021/6695833
work_keys_str_mv AT wenwenzhang listedgecoloringsofplanargraphswithoutadjacent7cycles
_version_ 1714657637930369024

Similar Items