JOURNAL ARTICLE

Upper bounds on adjacent vertex distinguishing total chromatic number of graphs

Xiaolan HuYunqing ZhangZhengke Miao

Year: 2017 Journal:   Discrete Applied Mathematics Vol: 233 Pages: 29-32   Publisher: Elsevier BV
Keywords:
Combinatorics Mathematics Edge coloring Vertex (graph theory) Brooks' theorem Complete coloring Fractional coloring Planar graph Discrete mathematics Graph Chromatic scale 1-planar graph Chordal graph Graph power Line graph

Metrics

2
Cited By
0.30
FWCI (Field Weighted Citation Impact)
11
Refs
0.56
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
Photochromic and Fluorescence Chemistry
Physical Sciences →  Materials Science →  Materials Chemistry

Related Documents

JOURNAL ARTICLE

The Adjacent Vertex Distinguishing Total Chromatic Number of Graphs

Zhiwen WangEnqiang Zhu

Journal:   International Conference on Bioinformatics and Biomedical Engineering Year: 2010 Vol: 48 Pages: 1-3
JOURNAL ARTICLE

The adjacent vertex distinguishing total chromatic number

Tom CokerKaren Johannson

Journal:   Discrete Mathematics Year: 2012 Vol: 312 (17)Pages: 2741-2750
JOURNAL ARTICLE

An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs

Bojan Stojanović

Journal:   Discrete Mathematics Year: 2017 Vol: 341 (5)Pages: 1472-1478
JOURNAL ARTICLE

An Upper Bound of the Adjacent-vertex-strong-distinguishing Total Chromatic Number of Graphs

Qiang Hui-yingHongshen Wang

Journal:   Advances in Mathematics(China) Year: 2013 Vol: 42 (6)Pages: 801-805
© 2026 ScienceGate Book Chapters — All rights reserved.