Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor

DOI10.1016/j.disc.2013.10.019zbMath1279.05043OpenAlexW2039530369MaRDI QIDQ393181

Ilan A. Goldfeder, Hortensia Galeana-Sánchez

Publication date: 16 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.10.019

zbMATH Keywords

Hamiltonian cyclesbipartite tournamentscycle factorsgeneralization of tournamentsspanning 1-diregular subdigraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Some results on the existence of Hamiltonian cycles in the generalized sum of digraphs ⋮ Vertex-pancyclism in the generalized sum of digraphs ⋮ Critical kernel imperfect problem in generalizations of bipartite tournaments ⋮ Miscellaneous Digraph Classes ⋮ Some results on the existence of Hamiltonian cycles in -compositions of bipartite digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the structure of strong 3-quasi-transitive digraphs
• The structure of strong arc-locally in-semicomplete digraphs
• A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
• Cycles and paths in bipartite tournaments with spanning configurations
• The structure of strong arc-locally semicomplete digraphs
• Locally semicomplete digraphs: A generalization of tournaments
• Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey

This page was built for publication: Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor