지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
초록· 키워드
오류제보하기
A tournament T is an orientation of a complete graph and an arc in T is called pancyclic if it is contained in a cycle of length l for all 3 ≤ l ≤ n, where n is the cardinality of the vertex set of T. In 1994, Moon [5] introduced the graph parameter h(T) as the maximum number of pancyclic arcs contained in the same Hamiltonian cycle of T and showed that h(T) ≥ 3 for all strong tournaments with n ≥ 3. Havet [4] later conjectured that h(T) ≥ 2k +1 for all k-strong tournaments and proved the case k = 2. In 2005, Yeo [7] gave the lower bound h(T)≥ k+5 2 for all k-strong tournaments T. In this note, we will improve his bound to h(T) ≥ 2k+7 3 .
목차
등록된 정보가 없습니다.
참고문헌 (7)
참고문헌 신청
A. Yeo / 2005 / The number of pancyclic arcs in a k-strong tournament / J. Graph Theory 50 (3) : 212 ~ 219
C. Thomassen / 1980 / Hamiltonian-connected tournaments / J. Combin. Theory Ser. B 28 (2) : 142 ~ 163
F. Havet / 2004 / Pancyclic arcs and connectivity in tournaments / J. Graph Theory 47 (2) : 87 ~ 110
J. Bang-Jensen / 2000 / Digraphs: Theory / Algorithms and Applications
J. Feng / 2008 / Hamiltonian Cycles in Certain Graphs and Out-arc Pancyclic Vertices in Tour-naments / Ph.D / RWTH Aachen
C. Thomassen / 1980 / Hamiltonian-connected tournaments / J. Combin. Theory Ser. B 28 (2) : 142 ~ 163
F. Havet / 2004 / Pancyclic arcs and connectivity in tournaments / J. Graph Theory 47 (2) : 87 ~ 110
J. Bang-Jensen / 2000 / Digraphs: Theory / Algorithms and Applications
J. Feng / 2008 / Hamiltonian Cycles in Certain Graphs and Out-arc Pancyclic Vertices in Tour-naments / Ph.D / RWTH Aachen
이 논문의 저자 정보
최근 본 자료
댓글(0)
0