Total weight choosability of graphs with bounded maximum average degree

Yunfang Tang; Xuding Zhu

doi:10.1016/j.disc.2016.10.002

ScienceGate Book Chapters

JOURNAL ARTICLE

Total weight choosability of graphs with bounded maximum average degree

Yunfang Tang Xuding Zhu

Year: 2016 Journal: Discrete Mathematics Vol: 340 (8)Pages: 2033-2042 Publisher: Elsevier BV

DOI: 10.1016/j.disc.2016.10.002

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Mathematics Vertex (graph theory) Neighbourhood (mathematics) Graph Weighting Bounded function Bound graph Discrete mathematics Graph power Line graph

Metrics

Cited By

0.30

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

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Total weight choosability of graphs with bounded maximum average degree

Metrics

Citation History

Topics

Related Documents

Weight Choosability of Graphs with Maximum Degree 4

On weight choosabilities of graphs with bounded maximum average degree

Improper choosability of graphs and maximum average degree

Total list weighting of graphs with bounded maximum average degree

Total choosability of planar graphs with maximum degree 4