Vertex-disjoint t-claws in graphs-Reference-Cited by-同舟云学术

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

Vertex-disjoint t-claws in graphs

Published:2007-06-01 Issue:2 Volume:43 Page:
ISSN:0916-5746
Container-title:SUT Journal of Mathematics
language:
Short-container-title:SUT J. Math.

Author:

Chiba Shuya¹

Affiliation:

1. Department of Mathematical Information Science, Tokyo University of Science Shinjuku-ku, Tokyo, 162-8601 Japan

Publisher

SUT Journal of Mathematics - Tokyo University of Science

Subject

General Mathematics

Reference8 articles.

1. [1] K. Corrádi and A. Hajnal, On the maximal number of independent circuits in a graph, Acta Math. Acad. Sci. Hungar. 14 (1963), 423–443.

2. [2] Y. Egawa, S. Fujita and K. Ota, ${K_{1,3}}$ -factors in graphs, Discrete Math, in press.

3. [3] Y. Egawa and K. Ota, Vertex-disjoint claws in graphs, Discrete Math. 197/198 (1999), 225–246.

4. [4] H. Enomoto, A. Kaneko and Zs. Tuza, ${P_3}$ -factors and covering cycles in graphs of minimum degree $n/3$ , Colloq. Math, Soc. János Bolyai 52 (1987), 213–220.

5. [5] S. Fujita, Vertex-Disjoint ${K_{1,t}}$ ’s in Graphs, Ars Combin. 64 (2002), 211–223.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP