Arc-disjoint Hamiltonian paths in non-round decomposable local tournaments

DOI10.1016/j.disc.2017.07.024zbMath1370.05125OpenAlexW2749914991MaRDI QIDQ2404382

Tingting Han, Rui Juan Li

Publication date: 18 September 2017

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

Full work available at URL: https://doi.org/10.1016/j.disc.2017.07.024

zbMATH Keywords

Hamiltonian cycleHamiltonian pathlocal tournamentarc-disjoint pathsemicomplete decomposition

Mathematics Subject Classification ID

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

Related Items (2)

Arc-disjoint Hamiltonian paths in strong round decomposable local tournaments ⋮ Locally Semicomplete Digraphs and Generalizations

Cites Work

• Unnamed Item
• 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
• Connectivity properties of locally semicomplete digraphs
• Strongly Hamiltonian-connected locally semicomplete digraphs
• Digraphs

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