Arc-disjoint Hamiltonian paths in strong round decomposable local tournaments

DOI10.7151/DMGT.2185zbMath1453.05041OpenAlexW2902837674WikidataQ128827978 ScholiaQ128827978MaRDI QIDQ2214324

Wei Meng

Publication date: 8 December 2020

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

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

zbMATH Keywords

local tournamentarc-disjoint Hamiltonian pathsround-decomposable tournament

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Decomposing locally semicomplete digraphs into strong spanning subdigraphs
• Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three
• Hamiltonian-connected tournaments
• A classification of locally semicomplete digraphs
• Arc-disjoint Hamiltonian cycles in round decomposable locally semicomplete digraphs
• Universal arcs in local tournaments
• Arc-disjoint Hamiltonian paths in non-round decomposable 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
• Classes of Directed Graphs

This page was built for publication: Arc-disjoint Hamiltonian paths in strong round decomposable local tournaments