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

Xiaohan Cheng; Jianliang Wu

doi:10.1007/s10878-017-0149-6

ScienceGate Book Chapters

JOURNAL ARTICLE

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

Xiaohan Cheng Jianliang Wu

Year: 2017 Journal: Journal of Combinatorial Optimization Vol: 35 (1)Pages: 1-13 Publisher: Springer Science+Business Media

DOI: 10.1007/s10878-017-0149-6

Get Full-Text PDF Get Analytical Report

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

Cited By

2.37

FWCI (Field Weighted Citation Impact)

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

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

Metrics

Citation History

Topics

Related Documents

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

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

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

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

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