본문 바로가기
KERD
논문KCI 등재

Complementary Cycles in Regular Multipartite Tournaments, Where One Cycle Has Length Four

1

조회

0

다운로드

1

인용

0

참고문헌

주제분류수학

초록

Abstract

The vertex set of a digraph D is denoted by V(D). A c-partite tournament is an orientation of a complete c-partite graph.In 1999, Yeo conjectured that each regular c-partite tournament D with c 4 and jV(D)j 8 contains a pair of vertex disjoint directed cycles of lengths 4 and jV(D)j 4. An example will demonstrate that Yeo’s conjecture is not true in general for regular 4-partite tournaments with two vertices in each partite. However, in all other cases we shall confirm this conjecture in affirmative.

참고문헌 (13)

  1. J. A. Bondy, "Diconnected orientation and a conjecture of Las Vergnas", 14, pp.277~282 (1976)
  2. Y. Guo, "Habilitation Thesis", pp.102~ (1998), RWTH Aachen
  3. G. Gutin, "Note on the path covering number of a semicomplete multipartitedigraph", 32, pp.231~237 (2000)
  4. "On subtournaments of a tournament", 9, pp.297~301 (1966)
  5. "Two complementary circuits in two-connected tournaments", 27, pp.321~334 (1985)
  6. "Complementary cycles of all lengths in tournaments", 57, pp.18~25 (1993)
  7. "Strong subtournaments of multipartite tournaments", 20, pp.189~196 (1999)
  8. "Cycles in multipartite tournaments: results and problems", pp.19~53 (2002), Discrete Math.
  9. "Complementary cycles in regular multipartite tournaments" (2002)
  10. "Almost regular multipartite tournaments containing a Hamiltonian path through a given arc" (2002)
  11. "One-diregular subgraphs in semicomplete multipartite digraphs", 24, pp.175~185 (1997)
  12. "Diregular c-partite tournaments are vertex-pancyclic when c ¸ 5", 32, pp.137~152 (1999)
  13. "How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?", 15, pp.481~493 (1999)

관련 논문AI추천

이 간행물의 다른 논문 (11건)