A Note on Well-Covered Graphs-Reference-Cited by-同舟云学术

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

A Note on Well-Covered Graphs

Published:1993 Issue: Volume: Page:179-181
ISSN:0167-5060
Container-title:Quo Vadis, Graph Theory? - A Source Book for Challenges and Directions
language:
Short-container-title:

Author:

Chvátal Václav,Slater Peter J.

Publisher

Elsevier

Reference10 articles.

1. Some covering concepts in graphs;Plummer;J. Combinatorial Theory,1970

2. Some common properties for regularizable graphs, edge-critical graphs and B -graphs;Berge;Tohoku Univ. Tsuken Symp. on Graph Theory and Algorithms,1980

3. Very well covered graphs;Favaron;Discrete Math.,1982

4. A game related to covering by stars;Finbow;Ars. Combinatoria,1983

5. A. Finbow, B. Hartnell, and R. Nowakowski, A characterisation of well-covered graphs of girth 5 or greater — submitted

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

1. Distinct sizes of maximal independent sets on graphs with restricted girth;RAIRO - Operations Research;2024-05

2. Recognizing well-dominated graphs is coNP-complete;Information Processing Letters;2024-01

3. Computing well-covered vector spaces of graphs using modular decomposition;Computational and Applied Mathematics;2023-11-22

4. Well-Covered Graphs With Constraints On $$\Delta $$ And $$\delta $$;Theory of Computing Systems;2023-08-28

5. 1-Extendability of Independent Sets;Algorithmica;2023-06-08

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP