List 3-dynamic coloring of graphs with small maximum average degree

Seog‐Jin Kim; Boram Park

doi:10.1016/j.disc.2017.09.025

ScienceGate Book Chapters

JOURNAL ARTICLE

List 3-dynamic coloring of graphs with small maximum average degree

Seog‐Jin Kim Boram Park

Year: 2017 Journal: Discrete Mathematics Vol: 341 (5)Pages: 1406-1418 Publisher: Elsevier BV

DOI: 10.1016/j.disc.2017.09.025

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Mathematics List coloring Fractional coloring Graph Edge coloring Brooks' theorem Chromatic scale Degree (music) Complete coloring Vertex (graph theory) Planar graph Discrete mathematics Graph power Physics Line graph

Metrics

Cited By

2.66

FWCI (Field Weighted Citation Impact)

Refs

0.89

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Retinoids in leukemia and cellular processes

Life Sciences → Biochemistry, Genetics and Molecular Biology → Molecular Biology

Topological and Geometric Data Analysis

Physical Sciences → Computer Science → Computational Theory and Mathematics

List 3-dynamic coloring of graphs with small maximum average degree

Metrics

Citation History

Topics

Related Documents

Acyclic 6-coloring of graphs with maximum degree 5 and small maximum average degree

Equitable list‐coloring for graphs of maximum degree 3

Equitable coloring and equitable choosability of graphs with small maximum average degree

Coloring squares of planar graphs with small maximum degree

Equitable List Coloring of Planar Graphs With Given Maximum Degree