Complementary cycles in irregular multipartite tournaments
Summary: A tournament is a directed graph obtained by assigning a direction for each edge in an undirected complete graph. A digraph \(D\) is cycle complementary if there exist two vertex disjoint cycles \(C\) and \(C'\) such that \(V(D) = V(C) \cup V(C')\). Let \(D\) be a locally almost regular \(c\)-partite tournament with \(c \geq 3\) and \(| \gamma(D) | \leq 3\) such that all partite sets have the same cardinality \(r\), and let \(C_3\) be a \(3\)-cycle of \(D\). In this paper, we prove that if \(D - V(C_3)\) has no cycle factor, then \(D\) contains a pair of disjoint cycles of length \(3\) and \(| V(D) | - 3\), unless \(D\) is isomorphic to \(T_7\), \(D_{4,2}\), \(D_{4,2}^\ast\), or \(D_{3,2}\).
- Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic
- Almost regular multipartite tournaments containing a Hamiltonian path through a given arc
- Complementary cycles in almost regular multipartite tournaments, where one cycle has length four
- Complementary cycles in almost regular multipartite tournaments.
- Complementary cycles in regular bipartite tournaments
- Complementary cycles in regular multipartite tournaments, where one cycle has length five
- Complementary cycles of all lengths in tournaments
- Cycles in multipartite tournaments: Results and problems
- Diconnected Orientations and a Conjecture of Las Vergnas
- Diregularc-partite tournaments are vertex-pancyclic whenc ? 5
- How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
- scientific article; zbMATH DE number 3914352 (Why is no real title available?)
- scientific article; zbMATH DE number 1463410 (Why is no real title available?)
- scientific article; zbMATH DE number 2145367 (Why is no real title available?)
- scientific article; zbMATH DE number 2147933 (Why is no real title available?)
- Kings in semicomplete multipartite digraphs
- Three supplements to Reid's theorem in multipartite tournaments
- Weakly Complementary Cycles in 3-Connected Multipartite Tournaments
- Weakly cycle complementary 3-partite tournaments
- Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang conjecture
- All regular multipartite tournaments that are cycle complementary
- All 2-connected in-tournaments that are cycle complementary
- Weakly Complementary Cycles in 3-Connected Multipartite Tournaments
- scientific article; zbMATH DE number 4127237 (Why is no real title available?)
- Complementary cycles in almost regular multipartite tournaments.
- Componentwise complementary cycles in multipartite tournaments
- Weakly cycle complementary 3-partite tournaments
- Cycle factors in strongly connected local tournaments
This page was built for publication: Complementary cycles in irregular multipartite tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1793296)
