Achromatic number is NP-complete for cographs and interval graphs-Reference-Cited by-同舟云学术

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

Achromatic number is NP-complete for cographs and interval graphs

Published:1989-05 Issue:3 Volume:31 Page:135-138
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Bodlaender Hans L.

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference12 articles.

1. Problems easy for tree-decomposable graphs;Arnborg,1988

2. Total domination in interval graphs;Bertossi;Inform. Process. Lett.,1986

3. The Maximum Cut and Minimum Cut Into Bounded Sets Problems on Cographs;Bodlaender,1987

4. Complement reducible graphs;Corneil;Disc. Applied Math.,1981

5. Computers and Intractibility, A Guide to the Theory of NP-Completeness;Garey,1979

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

1. Complexity of Maximum Cut on Interval Graphs;Discrete & Computational Geometry;2023-01-14

2. Complete edge-colored permutation graphs;Advances in Applied Mathematics;2022-08

3. A Polynomial-Time Algorithm for Finding a Spanning Tree with Non-Terminal Set <i>V<sub>NT</sub></i> on Circular-Arc Graphs;IEICE Transactions on Information and Systems;2022-08-01

4. Generalising the achromatic number to Zaslavsky's colourings of signed graphs;Theoretical Computer Science;2022-06

5. Approximate and exact results for the harmonious chromatic number;Discussiones Mathematicae Graph Theory;2022

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP