The H-force set of a hypertournament

DOI10.1016/J.DAM.2013.12.020MaRDI QIDQ2449068zbMATH OpenOpenAlexFDO

Authors Ruijuan Li, Yubao Guo, Xinhong Zhang, Shengjia Li, Qiaoping Guo

Publication date 6 May 2014

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

Full work available at URL https://doi.org/10.1016/j.dam.2013.12.020

zbMATH Keywords

\(H\)-force number\(H\)-force sethypertournaments

Mathematics Subject Classification ID

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

Recommendations

• On vertices enforcing a Hamiltonian cycle
• Enforced Hamiltonian cycles in circulant graphs
• \(H\)-force sets of locally semicomplete digraphs
• On the H-force number of Hamiltonian graphs and cycle extendability
• The H-force sets of the graphs satisfying the condition of Ore's theorem

Cites work

• \(H\)-force sets of locally semicomplete digraphs
• A generalization of rotational tournaments
• An application of the Ramsey theorem to ordered r-tournaments
• Edge-disjoint Hamiltonian cycles in hypertournaments
• Hamiltonian paths and cycles in hypertournaments
• scientific article; zbMATH DE number 165072 (Why is no real title available?)
• scientific article; zbMATH DE number 1156582 (Why is no real title available?)
• Kings in hypertournaments
• Note on the degree sequences of \(k\)-hypertournaments
• On score sequences of k-hypertournaments
• On the existence of \(k\)-tournaments with given automorphism group
• On the vertex-pancyclicity of hypertournaments
• On vertices enforcing a Hamiltonian cycle
• Vertex-pancyclicity of hypertournaments

Cited in

(9)

• The H-force sets of the graphs satisfying the condition of Ore's theorem
• The (1, 2)-step competition graph of a hypertournament
• On vertices enforcing a Hamiltonian cycle
• Miscellaneous digraph classes
• On pancyclic arcs in hypertournaments
• On the H-force number of Hamiltonian graphs and cycle extendability
• Enforced Hamiltonian cycles in generalized dodecahedra
• Enforced Hamiltonian cycles in circulant graphs
• \(H\)-force sets of locally semicomplete digraphs

This page was built for publication: The \(H\)-force set of a hypertournament

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2449068)