Maximum number of colors in hypertrees of bounded degree-Reference-Cited by-同舟云学术

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

Maximum number of colors in hypertrees of bounded degree

Published:2014-07-29 Issue:4 Volume:23 Page:867-876
ISSN:1435-246X
Container-title:Central European Journal of Operations Research
language:en
Short-container-title:Cent Eur J Oper Res

Author:

Bujtás Csilla,Tuza Zsolt

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research

Link

http://link.springer.com/content/pdf/10.1007/s10100-014-0357-4.pdf

Reference11 articles.

1. Arocha JL, Bracho J, Neumann-Lara V (1992) On the minimum size of tight hypergraphs. J Graph Theory 16:319–326

2. Bacsó G, Tuza Zs (2008) Upper chromatic number of finite projective planes. J Comb Des 16(3):221–230

3. Berge C (1989) Hypergraphs. North-Holland, Amsterdam

4. Bujtás Cs, Tuza Zs (2011) Maximum number of colors: C-coloring and related problems. J Geom 101:83–97

5. Bujtás Cs, Tuza Zs (2013) Approximability of the upper chromatic number of hypergraphs, manuscript

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

1. Editorial;Central European Journal of Operations Research;2015-10-23

2. Approximability of the upper chromatic number of hypergraphs;Discrete Mathematics;2015-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP