Cites work
- scientific article; zbMATH DE number 3150485 (Why is no real title available?)
- scientific article; zbMATH DE number 3303831 (Why is no real title available?)
- Cycles in k-strong tournaments
- Long paths and cycles in oriented graphs
- The Theory of Round Robin Tournaments
- The graphs for which all strong orientations are hamiltonian
Cited in
(15)- Cycles with a given number of vertices from each partite set in regular multipartite tournaments
- Paths with a given number of vertices from each partite set in regular multipartite tournaments
- Cycles and paths of many lengths in bipartite digraphs
- Cycles and paths in bipartite tournaments with spanning configurations
- Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments
- Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs
- \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Tournament completions of bipartite tournaments and their augmented directed cycles
- On multipartite tournaments
- Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP
- Sufficient conditions for a balanced bipartite digraph to be even pancyclic
- Multipartite tournaments: a survey
- Vertex-disjoint cycles in bipartite tournaments
- Semicomplete Multipartite Digraphs
This page was built for publication: Cycles in bipartite tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1154477)
