Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs-Reference-Cited by-同舟云学术

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

Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs

Published:2001 Issue:1 Volume:37 Page:48-77
ISSN:0364-9024
Container-title:Journal of Graph Theory
language:en
Short-container-title:J. Graph Theory

Author:

Dong F. M.,Koh K. M.,Teo K. L.,Little C. H. C.,Hendy M. D.

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Reference14 articles.

1. Classes of chromatically unique graphs

2. Some families of chromatically unique bipartite graphs

3. On chromatic uniqueness of two infinite families of graphs

4. The number of shortest cycles and the chromatic uniqueness of a graph

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

1. Chromaticity of a family of 5-partite graphs;Journal of the Association of Arab Universities for Basic and Applied Sciences;2014-04

2. Chromaticity of complete 6-partite graphs with certain star or matching deleted II;Acta Mathematicae Applicatae Sinica, English Series;2013-01

3. Chromaticity of complete 4-partite graphs with certain star or matching deleted;Applicable Analysis and Discrete Mathematics;2010

4. On chromatic uniqueness of certain 5-partite graphs;Journal of Applied Mathematics and Computing;2009-12-31

5. On the chromaticity of complete multipartite graphs with certain edges added;Discrete Mathematics;2009-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP