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

Cycles through a given set of vertices in regular multipartite tournaments

0

조회

0

다운로드

0

인용

0

참고문헌

주제분류수학

초록

Abstract

A tournament is an orientation of a complete graph, and in generala multipartite or c-partite tournament is an orientation of acomplete c-partite graph.In a recent article, the authors proved that a regular c-partitetournament with r ge 2 vertices in each partite set contains acycle with exactly r-1 vertices from each partite set, withexception of the case that c = 4 and r = 2. Here we willexamine the existence of cycles with r-2 vertices from eachpartite set in regular multipartite tournaments where the r-2vertices are chosen arbitrarily. Let D be a regular c-partitetournament and let X subseteq V(D) be an arbitrary set withexactly 2 vertices of each partite set. For all c ge 4 wewill determine the minimal value g(c) such that D-X isHamiltonian for every regular multipartite tournament with r geg(c).

참고문헌 (18)

  1. "Digraphs,Theory, algorithms and applications. Springer Monographs in Mathematics" (2001), Springer-Verlag London, Ltd., London
  2. "Semicomplete Multipartite Digraphs:A Generalization ofTournaments", pp.102~ (1998)
  3. "Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms : a survey", 19(4), pp.481~505 (1995)
  4. "Note on the path covering number of a semicomplete multipartite digraph", 32, pp.231~237 (2000)
  5. "On subtournaments of a tournament", pp.297~ (1966)
  6. "Theory of graphs" (1962)
  7. "How close to regularmust a multipartite tournament be to secure a given path covering number?"
  8. "Eine Extremalaufgabe aus der Graphentheorie", pp.436~48 (1941)
  9. "Fundamente der Graphentheorie,Springer Lehrbuch Mathematik" (1996), Sprin-ger-Verlag, Vienna
  10. "Strong subtournaments of multipartite tournaments", 20, pp.189~196 (1999)
  11. "Cycles in multipartite tournaments: results and problems", 245(1-3), pp.19~53 (2002)
  12. "Cycles with a given number of vertices from each partite set in regular multipartite tournaments", 56(3), pp.827~843 (2006)
  13. "On the connectivity of close to regular multipartite tournaments", 154(9), pp.1437~1452 (2006)
  14. "Almost regular c-partite tournaments contain a strong subtournaments of orderc when cgeq 5"
  15. "Close to Regular Multipartite Tournaments" (2004)
  16. "One-diregular subgraphs in semicomplete multipartite digraphs", 24(2), pp.175~185 (1997)
  17. "Semicomplete Multipartite Digraphs" (1998)
  18. "How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity ?", 15(4), pp.481~493 (1999)

관련 논문AI추천

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