\(H\)-force sets of locally semicomplete digraphs

DOI10.1016/j.dam.2012.06.014zbMath1251.05068MaRDI QIDQ714042

Rui Juan Li, Sheng-Jia Li, Xin-Hong Zhang

Publication date: 19 October 2012

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

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

zbMATH Keywords

locally semicomplete digraphs; \(H\)-force number; \(H\)-force set

Mathematics Subject Classification ID

05C38: Paths and cycles

05C20: Directed graphs (digraphs), tournaments

05C45: Eulerian and Hamiltonian graphs

Related Items

Unnamed Item, On the \(H\)-force number of Hamiltonian graphs and cycle extendability, Arc-disjoint Hamiltonian cycles in round decomposable locally semicomplete digraphs, The H-force sets of the graphs satisfying the condition of Ore's theorem, Arc-disjoint Hamiltonian paths in non-round decomposable local tournaments, The \(H\)-force set of a hypertournament

Cites Work

• A note on spanning local tournaments in locally semicomplete digraphs
• A classification of locally semicomplete digraphs
• On the structure of local tournaments
• On vertices enforcing a Hamiltonian cycle
• Locally semicomplete digraphs: A generalization of tournaments
• Kings in locally semicomplete digraphs
• A local tournament contains a vertex whose out-arcs are pseudo-girth-pancyclic
• Connectivity properties of locally semicomplete digraphs
• Strongly Hamiltonian-connected locally semicomplete digraphs