Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8

descriptionPublicationkeyboard_double_arrow_right Article 01 Oct 2020 English Publisher:Elsevier BVJournal:Discrete Mathematics, volume 343, page 112,014 (issn: 0012-365X,

Copyright policy )

Authors: Yulin Chang; Jie Hu; Guanghui Wang 0002; Xiaowei Yu;

doi: 10.1016/j.disc.2020.112014

Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

Shandong Women’s University
China (People's Republic of)
Jiangxi Normal University
China (People's Republic of)

Keywords

Coloring of graphs and hypergraphs, discharging, planar graph, Vertex degrees, combinatorial Nullstellensatz, adjacent vertex distinguishing total coloring, Planar graphs; geometric and topological aspects of graph theory

Impact byBIP!

	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).	8
	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.	Top 10%
	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.	Top 10%