Complementary cycles in irregular multipartite tournaments
From MaRDI portal
Publication:1793296
DOI10.1155/2016/5384190zbMath1400.05099OpenAlexW2511605261WikidataQ59131565 ScholiaQ59131565MaRDI QIDQ1793296
Xiaoying Wang, Caiming Zhang, Zhi-hong He
Publication date: 12 October 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2016/5384190
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complementary cycles in regular bipartite tournaments
- Weakly cycle complementary 3-partite tournaments
- Complementary cycles of all lengths in tournaments
- Three supplements to Reid's theorem in multipartite tournaments
- Complementary cycles in regular multipartite tournaments, where one cycle has length five
- Cycles in multipartite tournaments: Results and problems
- Almost regular multipartite tournaments containing a Hamiltonian path through a given arc
- How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
- Complementary cycles in almost regular multipartite tournaments, where one cycle has length four
- Weakly Complementary Cycles in 3-Connected Multipartite Tournaments
- Diconnected Orientations and a Conjecture of Las Vergnas
- Diregularc-partite tournaments are vertex-pancyclic whenc ? 5
- Kings in semicomplete multipartite digraphs
- Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic
This page was built for publication: Complementary cycles in irregular multipartite tournaments
