H-force sets of locally semicomplete digraphs

DOI10.1016/J.DAM.2012.06.014zbMATH Open1251.05068OpenAlexW2047937567MaRDI QIDQ714042FDOQ714042

Ruijuan Li, Shengjia Li, Xinhong 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

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

Cites Work

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

Cited In (7)

• The H-force sets of the graphs satisfying the condition of Ore's theorem
• Arc-disjoint Hamiltonian paths in non-round decomposable local tournaments
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the \(H\)-force number of Hamiltonian graphs and cycle extendability
• Arc-disjoint Hamiltonian cycles in round decomposable locally semicomplete digraphs
• The \(H\)-force set of a hypertournament

This page was built for publication: \(H\)-force sets of locally semicomplete digraphs

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