Neighbor sum distinguishing total colorings via the Combinatorial Nullstellensatz-Reference-Cited by-同舟云学术

Neighbor sum distinguishing total colorings via the Combinatorial Nullstellensatz

Published:2014-03-06 Issue:9 Volume:57 Page:1875-1882
ISSN:1674-7283
Container-title:Science China Mathematics
language:en
Short-container-title:Sci. China Math.

Author:

Ding LaiHao,Wang GuangHui,Yan GuiYing

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics

Link

http://link.springer.com/content/pdf/10.1007/s11425-014-4796-0.pdf

Reference25 articles.

1. Alon N. Combinatorial Nullstellensatz. Combin Probab Comput, 1999, 8: 7–29

2. Bondy J A, Murty U S R. Graph Theory with Applications. New York: North-Holland, 1976

3. Chen X E. On the adjacent vertex distinguishing total coloring numbers of graphs with Δ = 3. Discrete Math, 2008, 308: 4003–4007

4. Cheng X H, Wu J L, Huang D J, et al. Neighbor sum distinguishing total colorings of planar graphs with maximum degree Δ. Submitted, 2013

5. Dong A J, Wang G H. Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree. Acta Math Sin Engl Ser, in press, 2013

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

1. Neighbor Sum Distinguishing Total Choosability of Planar Graphs with Maximum Degree at Least 10;Acta Mathematicae Applicatae Sinica, English Series;2024-01

2. Neighbor sum distinguishing total coloring of planar graphs with restrained cycles;Discrete Mathematics, Algorithms and Applications;2023-06-23

3. Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24;Discrete Mathematics;2021-01

4. Neighbor Sum Distinguishing Total Colorings of Corona of Subcubic Graphs;Bulletin of the Malaysian Mathematical Sciences Society;2020-10-27

5. Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8;Discrete Mathematics;2020-10