On Cyclic Decompositions of Complete Graphs into Tripartite Graphs
Author:
Affiliation:
1. DEPARTMENT OF MATHEMATICS; ILLINOIS STATE UNIVERSITY; NORMAL; IL 61790-4520
2. DEPARTMENT OF MATHEMATICS; SCHOOL OF SCIENCE; UNIVERSITY OF THE THAI CHAMBER OF COMMERCE; BANGKOK; 10400; THAILAND
Publisher
Wiley
Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Reference9 articles.
1. A survey on the existence of G-designs;Adams;J Combin Des,2008
2. A note on the cyclic decomposition of complete graphs into bipartite graphs;Blinco;Bull Inst Combin Appl,2004
3. On the cyclic decomposition of complete graphs into almost-bipartite graphs;Blinco;Discrete Math,2004
4. D. Bryant Cycle decompositions of complete graphs A. Hilton J. Talbot Surveys in combinatorics 2007, Proceedings of the 21st British Combinatorial Conference, In: London Mathematical Society Lecture Note Series Cambridge University Press 2007 67 97
5. Disjoint difference families with block size 3;Dinitz;Util Math,1997
Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Decomposing K18n and K18n + 1 into connected unicyclic graphs with 9 edges;Electronic Journal of Graph Theory and Applications;2023-04-08
2. On 1-rotational decompositions of complete graphs into tripartite graphs;Opuscula Mathematica;2019
3. Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph G where G is the union of two disjoint cycles;European Journal of Combinatorics;2018-02
4. On $$\sigma $$ σ -Tripartite Labelings of Odd Prisms and Even Möbius Ladders;Bulletin of the Malaysian Mathematical Sciences Society;2017-05-24
5. On Decomposing the Complete Graph into the Union of Two Disjoint Cycles;Lecture Notes in Computer Science;2015
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3