Maximum uniformly resolvable decompositions of Kv and Kv−I into 3-stars and 3-cycles-Reference-Cited by-同舟云学术

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

Maximum uniformly resolvable decompositions of Kv and Kv−I into 3-stars and 3-cycles

Published:2015-10 Issue:10 Volume:338 Page:1667-1673
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Küçükçi̇fçi̇ Selda,Milici Salvatore,Tuza Zsolt

Funder

Scientific and Technological Research Council of Turkey

C.N.R.

Hungarian Scientific Research Fund, OTKA

Hungarian State and the European Union

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference14 articles.

1. The wonderful Walecki construction;Alspach;Bull. Inst. Combin. Appl.,2008

2. The CRC Handbook of Combinatorial Designs;Colbourn,2007

3. The Hamilton–Waterloo problem for cycle sizes 3 and 4;Danziger;J. Combin. Des.,2004

4. Maximum uniformly resolvable designs with block sizes 2 and 4;Dinitz;Discrete Math.,2009

5. K1,k-factorizations of complete bipartite graphs;Du;Discrete Math.,2002

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

1. Complex uniformly resolvable decompositions of K_v;Ars Mathematica Contemporanea;2021-03-25

2. Uniformly Resolvable Decompositions of Kv-I into n-Cycles and n-Stars, for Even n;Mathematics;2020-10-13

3. ON UNIFORMLY RESOLVABLE {K-1,K-2, K-1,K-3}-DESIGNS;ATTI ACCAD PELORIT;2018

4. Uniformly Resolvable Cycle Decompositions with Four Different Factors;Graphs and Combinatorics;2017-10-31

5. Uniformly resolvable decompositions of Kv into K2 and K1,3 graphs;Discrete Mathematics;2016-08

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP