The Smallest Uniform Color-Bounded Hypergraphs Which are One-Realizations of a Given Set-Reference-Cited by-同舟云学术

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

The Smallest Uniform Color-Bounded Hypergraphs Which are One-Realizations of a Given Set

Published:2017-05-24 Issue:4 Volume:33 Page:869-883
ISSN:0911-0119
Container-title:Graphs and Combinatorics
language:en
Short-container-title:Graphs and Combinatorics

Author:

Diao Kefeng,Lu Fuliang,Voloshin Vitaly,Zhao Ping

Funder

National Natural Science Foundation of China

Shandong Province

Publisher

Springer Science and Business Media LLC

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Link

http://link.springer.com/article/10.1007/s00373-017-1810-7/fulltext.html

Reference29 articles.

1. Axenovich, M., Kündgen, A.: On a generalized anti-Ramsey problem. Combinatorica 21, 335–349 (2001)

2. Bujtás, C., Tuza, Z.: Color-bounded hypergraphs, I: general results. Discret. Math. 309, 4890–4902 (2009)

3. Bujtás, C., Tuza, Z.: Color-bounded hypergraphs, II: interval hypergraphs and hypertrees. Discret. Math. 309, 6391–6401 (2009)

4. Bujtás, C., Tuza, Z.: Color-bounded hypergraphs, III: model comparison. Appl. Anal. Discret. Math. 1, 36–55 (2007)

5. Bujtás, C., Tuza, Z.: Color-bounded hypergraphs, IV: stable colorings of hypertrees. Discret. Math. 310, 1463–1474 (2010)

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

1. Some classifications of graphs with respect to a set adjacency relation;Discrete Mathematics, Algorithms and Applications;2020-09-21

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3