JOURNAL ARTICLE

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

Xiaohan ChengJianliang Wu

Year: 2017 Journal:   Journal of Combinatorial Optimization Vol: 35 (1)Pages: 1-13   Publisher: Springer Science+Business Media
Keywords:
Combinatorics Mathematics Vertex (graph theory) Prime (order theory) Total coloring Graph Planar graph Complete coloring Edge coloring Fractional coloring Degree (music) Discrete mathematics Physics Graph power Line graph

Metrics

9
Cited By
2.37
FWCI (Field Weighted Citation Impact)
27
Refs
0.87
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

Related Documents

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

Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23

Lin SunGuanglong YuXin Li

Journal:   Discrete Applied Mathematics Year: 2023 Vol: 337 Pages: 257-271
JOURNAL ARTICLE

The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11

Xiaohan ChengWang BinJihui Wang

Journal:   Discrete Applied Mathematics Year: 2022 Vol: 313 Pages: 29-39
JOURNAL ARTICLE

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

Weifan WangDanjun Huang

Journal:   Scientia Sinica Mathematica Year: 2012 Vol: 42 (2)Pages: 151-164
JOURNAL ARTICLE

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

Yu‐Lin ChangJie HuGuanghui WangXiaowei Yu

Journal:   Discrete Mathematics Year: 2020 Vol: 343 (10)Pages: 112014-112014
© 2026 ScienceGate Book Chapters — All rights reserved.