A complete solution to the infinite Oberwolfach problem-Reference-Cited by-同舟云学术

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

A complete solution to the infinite Oberwolfach problem

Published:2020-02-05 Issue:5 Volume:28 Page:366-383
ISSN:1063-8539
Container-title:Journal of Combinatorial Designs
language:en
Short-container-title:J Combin Des

Author:

Costa Simone¹^ORCID

Affiliation:

1. DICATAM—Sez. Matematica Università degli Studi di Brescia Brescia Italy

Funder

111 Project of China

Italian Ministry of Education, Universities and Research, PRIN 2015

Publisher

Wiley

Subject

Discrete Mathematics and Combinatorics

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/jcd.21702

Reference24 articles.

1. Abelian 1-factorizations in infinite graphs

2. On bipartite 2-factorizations of kn − I and the Oberwolfach problem

3. Complete solutions to the Oberwolfach problem for an infinite set of orders

4. Cycle decompositions with a sharply vertex transitive automorphism group;Buratti M.;Le Matematiche,2004

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

1. Factorizing the Rado graph and infinite complete graphs;Ars Mathematica Contemporanea;2023-08-01

2. On the mini-symposium problem;Ars Mathematica Contemporanea;2023-04-08

3. On the Oberwolfach problem for single-flip 2-factors via graceful labelings;Journal of Combinatorial Theory, Series A;2022-07

4. Vertex‐regular 1‐factorizations in infinite graphs;Journal of Combinatorial Designs;2022-02-08

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP