A linear 5-coloring algorithm of planar graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A linear 5-coloring algorithm of planar graphs

Published:1981-12 Issue:4 Volume:2 Page:317-327
ISSN:0196-6774
Container-title:Journal of Algorithms
language:en
Short-container-title:Journal of Algorithms

Author:

Chiba Norishige,Nishizeki Takao,Saito Nobuji

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference4 articles.

1. Graphs and Network;Carre,1979

2. N. Chiba, T. Nishizeki, and N. Saito, An approximation algorithm for the maximum independent set problem on planar graphs, submitted for publication.

3. Some simplified NP-complete graph problems;Garey;Theor. Comput. Sci.,1976

4. A batching method for coloring planar graphs;Lipton;Inform. Process. Lett.,1978

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

1. Physical Zero-Knowledge Proofs for Five Cells;Progress in Cryptology – LATINCRYPT 2023;2023

2. Distributed Multi-agent Deployment for Full Visibility of 1.5D and 2.5D Polyhedral Terrains;Journal of Intelligent & Robotic Systems;2020-07-17

3. Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces;Algorithmica;2019-10-31

4. Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces;Lecture Notes in Computer Science;2018

5. Graph Coloring;Basic Graph Theory;2017

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP