Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24

Lin Sun; Guanglong Yu; Xin Li

doi:10.1016/j.disc.2020.112190

ScienceGate Book Chapters

JOURNAL ARTICLE

Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24

Lin Sun Guanglong Yu Xin Li

Year: 2020 Journal: Discrete Mathematics Vol: 344 (1)Pages: 112190-112190 Publisher: Elsevier BV

DOI: 10.1016/j.disc.2020.112190

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Mathematics Total coloring Graph Planar graph Degree (music) Edge coloring List coloring Integer (computer science) Discrete mathematics Simple graph Graph power Physics Line graph Computer science

Metrics

Cited By

0.59

FWCI (Field Weighted Citation Impact)

Refs

0.73

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24

Metrics

Citation History

Topics

Related Documents

Neighbor Sum Distinguishing Total Choosability of 1-planar Graphs with Maximum Degree at Least 15

Neighbor Sum Distinguishing Total Choosability of Planar Graphs with Maximum Degree at Least 10

Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10

The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven

Neighbor sum distinguishing total choosability of planar graphs