Plane graphs with $$\Delta =7$$ are entirely 10-colorable-Reference-Cited by-同舟云学术

Plane graphs with $$\Delta =7$$ are entirely 10-colorable

Published:2020-03-13 Issue:1 Volume:40 Page:1-20
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Kong Jiangxu,Hu Xiaoxue^ORCID,Wang Yiqiao

Funder

National Natual Science Fundation of China

Zhejiang Natual Science Fundation

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-020-00561-9.pdf

Reference15 articles.

1. Borodin OV (1987) Coupled colorings of graphs on a plane. Metody Diskret Anal 45:21–27 (in Russian)

2. Borodin OV (1993) Simultaneous coloring of edge neighborhoods in planar graphs and the simultaneous coloring of vertices, edges and faces. Mat Zametki 53:35–47 (in Russian)

3. Borodin OV (1995) A new proof of the 6 colour theorem. J Graph Theory 19:507–521

4. Borodin OV (1996) Structural theorm on plane graphs with application to the entire coloring number. J Graph Theory 23:233–239

5. Dong W, Lin WS (2014) Entire coloring of plane graph with maximum degree eleven. Discrete Math 336:46–56

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

1. Parallel Machines Scheduling with Deteriorating Maintenance Activities and Job Rejection;Asia-Pacific Journal of Operational Research;2022-04-18

2. A Bi-criteria Analysis for Fuzzy C-means Problem;Algorithmic Aspects in Information and Management;2020