JOURNAL ARTICLE
Neighbor Sum Distinguishing Total Choosability of Planar Graphs with Maximum Degree at Least 10
Dong-han ZhangYou LuShenggui ZhangLi Zhang
Year: 2024 Journal: Acta Mathematicae Applicatae Sinica English Series Vol: 40 (1)Pages: 211-224 Publisher: Springer Science+Business Media
Keywords:
Combinatorics Total coloring Conjecture Mathematics Planar graph Vertex (graph theory) Complete coloring Degree (music) Graph List coloring Edge coloring Planar Brooks' theorem Discrete mathematics 1-planar graph Chordal graph Physics Computer science Graph power Line graph
Metrics
0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
26
Refs
0.01
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Topics
Graph Labeling and Dimension Problems
Physical Sciences → Computer Science → Computational Theory and Mathematics
Related Documents
JOURNAL ARTICLE
Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24
Journal: Discrete Mathematics Year: 2020 Vol: 344 (1)Pages: 112190-112190
JOURNAL ARTICLE
Neighbor Sum Distinguishing Total Choosability of 1-planar Graphs with Maximum Degree at Least 15
Lin SunDi SunXin LiGuanglong Yu
Journal: Acta Mathematicae Applicatae Sinica English Series Year: 2025 Vol: 41 (3)Pages: 898-914
JOURNAL ARTICLE
Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
Yu‐Lin ChangQiancheng OuyangGuanghui Wang
Journal: Journal of Combinatorial Optimization Year: 2019 Vol: 38 (1)Pages: 185-196
JOURNAL ARTICLE
The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
Journal: Journal of Combinatorial Optimization Year: 2017 Vol: 35 (1)Pages: 1-13
JOURNAL ARTICLE
Neighbor sum distinguishing total choosability of planar graphs
Cunquan QuGuanghui WangGuiying YanXiaowei Yu
Journal: Journal of Combinatorial Optimization Year: 2015 Vol: 32 (3)Pages: 906-916