Complementary cycles of all lengths in tournaments
From MaRDI portal
Publication:757404
DOI10.1006/JCTB.1993.1002zbMATH Open0723.05062OpenAlexW1975943028MaRDI QIDQ757404FDOQ757404
Publication date: 1993
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1993.1002
Recommendations
- Cycles in a tournament with pairwise zero, one or two given vertices in common
- On disjoint cycles of the same length in tournaments
- scientific article; zbMATH DE number 2147933
- Vertex-disjoint cycles of prescribed length on tournaments
- Disjoint 3-cycles in tournaments: a proof of the Bermond-Thomassen conjecture for tournaments
Cited In (28)
- On complementary cycles in locally semicomplete digraphs
- Complementary cycles in regular bipartite tournaments
- Cycle factors in strongly connected local tournaments
- Three supplements to Reid's theorem in multipartite tournaments
- Safe sets and in-dominating sets in digraphs
- Triangle packings and 1-factors in oriented graphs
- Title not available (Why is that?)
- Cycles in a tournament with pairwise zero, one or two given vertices in common
- The partition of a strong tournament
- All regular multipartite tournaments that are cycle complementary
- Partitioning vertices of a tournament into independent cycles
- All 2-connected in-tournaments that are cycle complementary
- Multipartite tournaments: a survey
- A survey on Hamilton cycles in directed graphs
- Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
- Complementary cycles of any length in regular bipartite tournaments
- Minimum cycle factors in quasi-transitive digraphs
- Tournaments and Semicomplete Digraphs
- Semicomplete Multipartite Digraphs
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
- Complementary cycles in almost regular multipartite tournaments, where one cycle has length four
- Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang conjecture
- Complementary cycles in irregular multipartite tournaments
- On 1-factors with prescribed lengths in tournaments
- Componentwise complementary cycles in multipartite tournaments
- Complementary cycles in regular multipartite tournaments, where one cycle has length five
- Finding complementary cycles in locally semicomplete digraphs
- Title not available (Why is that?)
This page was built for publication: Complementary cycles of all lengths in tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757404)
