Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor
From MaRDI portal
(Redirected from Publication:393181)
Recommendations
- Sufficient conditions for Hamiltonian cycles in bipartite digraphs
- Cycles and paths in bipartite tournaments with spanning configurations
- A sufficient condition for Hamiltonian cycles in bipartite tournaments
- A conjecture on 3-anti-quasi-transitive digraphs
- Some results on the existence of Hamiltonian cycles in the generalized sum of digraphs
Cites work
- scientific article; zbMATH DE number 3859163 (Why is no real title available?)
- scientific article; zbMATH DE number 3979087 (Why is no real title available?)
- scientific article; zbMATH DE number 1498519 (Why is no real title available?)
- A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
- Advanced modern algebra
- Cycles and paths in bipartite tournaments with spanning configurations
- Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
- Locally semicomplete digraphs: A generalization of tournaments
- On the structure of strong 3-quasi-transitive digraphs
- The structure of strong arc-locally in-semicomplete digraphs
- The structure of strong arc-locally semicomplete digraphs
Cited in
(7)- Some results on the existence of Hamiltonian cycles in the generalized sum of digraphs
- Critical kernel imperfect problem in generalizations of bipartite tournaments
- Vertex-pancyclism in the generalized sum of digraphs
- Hamiltonian Cycles in Regular Tournaments
- Some results on the existence of Hamiltonian cycles in \(\mathcal{P} \)-compositions of bipartite digraphs
- Miscellaneous digraph classes
- scientific article; zbMATH DE number 589725 (Why is no real title available?)
This page was built for publication: Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393181)