Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete-Reference-Cited by-同舟云学术

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

Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete

Published:1980 Issue:3 Volume:30 Page:289-293
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Dailey David P.

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference7 articles.

1. Graph coloring by humans and machines;Dailey,1978

2. The complexity of theorem-proving procedures;Cook,1971

3. Reducibility among combinatorial problems;Karp,1972

4. Some simplified NP-complete graph problems;Garey;Theoretical Computer Science,1976

5. The design and Analysis of Computer Algorithms;Aho,1974

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

1. Hardness transitions and uniqueness of acyclic colouring;Discrete Applied Mathematics;2024-03

2. Shortest Longest-Path Graph Orientations;Lecture Notes in Computer Science;2023-12-09

3. Pliability and Approximating Max-CSPs;Journal of the ACM;2023-11-30

4. On the parameterized complexity of clustering problems for incomplete data;Journal of Computer and System Sciences;2023-06

5. Sudoku number of graphs;AKCE International Journal of Graphs and Combinatorics;2023-05-04

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP