The listL(2,1)-labeling of planar graphs-Reference-Cited by-同舟云学术

The listL(2,1)-labeling of planar graphs

Published:2018-08 Issue:8 Volume:341 Page:2211-2219
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Zhu Haiyang,Miao Lianying,Chen Sheng,Lü Xinzhong,Song Wenyao

Funder

NSFC

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference20 articles.

1. Colorings and orientations of graphs;Alon;J. Combinatorica,1992

2. Labeling planar graphs with a condition at distance two;Bella;European J. Combin.,2007

3. Graph Theory with Applications;Bondy,1976

4. O.V. Borodin, H.J. Broersma, A. Glebov, J. Van Den Heuvel, Stars and bunches in planar graphs. Part : General planar graphs and colorings, CD AM, Research report, 2002.

5. List 2-distance (Δ + 1)-coloring of planar graphs with given girth;Borodin;Diskretn. Anal. Issled. Oper.,2007

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On list (p, 1)-total labellings of special planar graphs and 1-planar graphs;Journal of Combinatorial Optimization;2024-03-13

2. Coloring Squares of Planar Graphs with Maximum Degree at Most Five;Graphs and Combinatorics;2023-02-11

3. Optimal frequency assignment and planar list L(2, 1)-labeling;Journal of Combinatorial Optimization;2021-08-11

4. Two results on K-(2,1)-total choosability of planar graphs;Discrete Mathematics, Algorithms and Applications;2020-07-30

5. The List L(2, 1)-Labeling of Planar Graphs with Large Girth;Algorithmic Aspects in Information and Management;2020