Arc-disjoint Hamiltonian cycles in round decomposable locally semicomplete digraphs

DOI10.7151/dmgt.2023zbMath1383.05135OpenAlexW2771579207MaRDI QIDQ1708395

Tingting Han, Rui Juan Li

Publication date: 23 March 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2023

zbMATH Keywords

Hamiltonian cycleHamiltonian pathlocal tournamentlocally semicomplete digrapharc-disjointround decomposable

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Arc-disjoint Hamiltonian paths in strong round decomposable local tournaments

Cites Work

• Unnamed Item
• Decomposing locally semicomplete digraphs into strong spanning subdigraphs
• \(H\)-force sets of locally semicomplete digraphs
• Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three
• A classification of locally semicomplete digraphs
• On the structure of local tournaments
• 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
• Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments
• Strongly Hamiltonian-connected locally semicomplete digraphs
• Digraphs
• The Theory of Round Robin Tournaments

This page was built for publication: Arc-disjoint Hamiltonian cycles in round decomposable locally semicomplete digraphs