지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
이용수
초록· 키워드
오류제보하기
The complete multipartite graph Kn(2t) having n partite sets
of size 2t, with n ≥ 6 and t ≥ 1, is shown to have a decomposition into
gregarious 6-cycles, that is, the cycles which have at most one vertex from
any particular partite set. Complete sets of differences of numbers in Zn
are used to produce starter cycles and obtain other cycles by rotating the
cycles around the n-gon of the partite sets.
목차
등록된 정보가 없습니다.
참고문헌 (9)
참고문헌 신청
B. Alspach / 2001 / Cycle decompositions of Kn and Kn ? I / Journal of Combinatorial Theory Series B 81 (1) : 77 ~ 99
D. Sotteau / 1981 / Decomposition of Km,n(K?m,n) into cycles (circuits) of length 2k / Journal of Combinatorial Theory Series B 30 (1) : 75 ~ 81
E. Billington / / Resolvable gregarious cycle decompositions of complete equipartite graphs, Preprint
E. Billington / 2003 / Decomposition of complete tripartite graphs into gregarious 4-cycles / Discrete Mathematics 261 (1) : 87 ~ 111
J. Liu / 2000 / A generalization of the Oberwolfach problem and Ct-factorizations of complete equipartite graphs / Journal of Combinatorial Designs 8 (1) : 42 ~ 49
D. Sotteau / 1981 / Decomposition of Km,n(K?m,n) into cycles (circuits) of length 2k / Journal of Combinatorial Theory Series B 30 (1) : 75 ~ 81
E. Billington / / Resolvable gregarious cycle decompositions of complete equipartite graphs, Preprint
E. Billington / 2003 / Decomposition of complete tripartite graphs into gregarious 4-cycles / Discrete Mathematics 261 (1) : 87 ~ 111
J. Liu / 2000 / A generalization of the Oberwolfach problem and Ct-factorizations of complete equipartite graphs / Journal of Combinatorial Designs 8 (1) : 42 ~ 49
함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
A difference set method for circulant decompositions of complete partite graphs into gregarious 4-cycles
East Asian Mathematical Journal
2010 .01
-
ON DECOMPOSITIONS OF THE COMPLETE EQUIPARTITE GRAPHS Kkm(2t) INTO GREGARIOUS m-CYCLES
East Asian Mathematical Journal
2013 .01
-
A note on decomposition of complete equipartite graphs into gregarious $6$-cycles
대한수학회보
2007 .01
-
A REMARK ON CIRCULANT DECOMPOSITIONS OF COMPLETE MULTIPARTITE GRAPHS BY GREGARIOUS CYCLES
East Asian Mathematical Journal
2017 .01
-
Complementary Cycles in Regular Multipartite Tournaments, Where One Cycle Has Length Four
Kyungpook Mathematical Journal
2004 .01
-
Weakly Complementary Cycles in 3-Connected Multipartite Tournaments
Kyungpook Mathematical Journal
2008 .01
-
SCORE SETS IN k-PARTITE TOURNAMENTS
Journal of applied mathematics & computing
2006 .01
-
Enumeration of graphs with given weighted number of connected components
대한수학회보
2017 .01
-
Circulant Decompositions of Certain Multipartite Graphs into Gregarious Cycles of a Given Length
East Asian Mathematical Journal
2014 .01
-
DISJOINT SMALL CYCLES IN GRAPHS
Journal of applied mathematics & informatics
2009 .01
-
Signed degree sequences in signed 3-partite graphs
JOURNAL OF THE KOREAN SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS
2007 .06
-
A sufficient condition for acyclic 5-choosability of planar graphs without 5-cycles
대한수학회보
2018 .01
-
MARK SEQUENCES IN 3-PARTITE 2-DIGRAPHS
JOURNAL OF THE KOREAN SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS
2007 .03
-
SOME PROBLEMS AND RESULTS ON CIRCUIT GRAPHS AND TRIANGULAR GRAPHS
Journal of applied mathematics & informatics
2008 .01
-
On the Basis Number of the Semi-Strong Product of Bipartite Graphs with Cycles
Kyungpook Mathematical Journal
2005 .01
-
ON CYCLIC DECOMPOSITIONS OF THE COMPLETE GRAPH INTO THE 2-REGULAR GRAPHS
Journal of applied mathematics & computing
2007 .01
-
SIGNED A-POLYNOMIALS OF GRAPHS AND POINCAR´E POLYNOMIALS OF REAL TORIC MANIFOLDS
대한수학회보
2015 .01
-
Total domination number of central graphs
대한수학회보
2019 .01
-
암석 순환의 구성요소와 과정에 대한 예비 지구과학 교사들의 이해
대한지구과학교육학회지
2016 .01
-
DISJOINT CYCLES WITH PRESCRIBED LENGTHS AND INDEPENDENT EDGES IN GRAPHS
대한수학회지
2014 .01
이 논문의 저자 정보
최근 본 자료
댓글(0)
0