Strong cliques in diamond-free graphs-Reference-Cited by-同舟云学术

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

Strong cliques in diamond-free graphs

Published:2021-02 Issue: Volume:858 Page:49-63
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Chiarelli Nina,Martínez-Barona Berenice,Milanič Martin^ORCID,Monnot Jérôme,Muršič Peter

Funder

Slovenian Research Agency

Horizon 2020

CONACYT

Erasmus+

MICINN

AGAUR

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference58 articles.

1. Strong cliques and equistability of EPT graphs;Alcón;Discrete Appl. Math.,2016

2. A characterization of claw-free CIS graphs and new results on the order of CIS graphs;Alcón;Electron. Notes Theor. Comput. Sci.,2019

3. On the number of maximal independent sets in graphs from hereditary classes;Alekseev,1991

4. When are chordal graphs also partition graphs?;Anbeek;Australas. J. Comb.,1997

5. Not complementary connected and not CIS d-graphs form weakly monotone families;Andrade;Discrete Math.,2010

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

1. Linear χ -binding functions for some classes of ( P ₃ ∪ P ₂ )-free graphs;AKCE International Journal of Graphs and Combinatorics;2024-02-06

2. Total Domination, Separated-Cluster, CD-Coloring: Algorithms and Hardness;Lecture Notes in Computer Science;2024

3. In memory of Jérôme Monnot;Theoretical Computer Science;2022-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP