List Edge Colorings of Planar Graphs without Adjacent 7-Cycles
Copyright policy ) Wenwen Zhang;
List Edge Colorings of Planar Graphs without Adjacent 7-Cycles
In this paper, we get that G is edge- k -choosable ( k = max 10 , Δ G ) for planar graph G without adjacent 7-cycles.
- Shandong Women’s University China (People's Republic of)
- Shandong Women's University
Coloring of graphs and hypergraphs, QA1-939, Mathematics, Planar graphs; geometric and topological aspects of graph theory
Coloring of graphs and hypergraphs, QA1-939, Mathematics, Planar graphs; geometric and topological aspects of graph theory
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
selected citations
Citations provided by BIP!
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
Citations provided by BIP!popularityPopularity provided by BIP!
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Popularity provided by BIP! 0
Average
Average
Average
gold
Fields of Science