The r-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size-Reference-Cited by-同舟云学术

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

The r-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size

Published:2023-04 Issue:4 Volume:346 Page:113342
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Li Yanjia,Spirkl Sophie^ORCID

Funder

Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada

Natural Sciences and Engineering Research Council of Canada

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference16 articles.

1. A linear-time algorithm for testing the truth of certain quantified Boolean formulas;Aspvall;Inf. Process. Lett.,1979

2. On graphs with polynomially solvable maximum-weight clique problem;Balas;Networks,1989

3. Hypergraph colouring;Bujtás,2015

4. Properly 2-colouring linear hypergraphs;Chattopadhyay,2007

5. Colouring vertices of triangle-free graphs without forests;Dabrowski;Discrete Math.,2012

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP