Spanning acyclic subdigraphs and strong \(t\)-panconnectivity of tournaments

DOI10.1016/j.dam.2022.07.021zbMath1498.05118OpenAlexW4291237132WikidataQ113877172 ScholiaQ113877172MaRDI QIDQ2081462

Lan Xiao, Yubao Guo

Publication date: 13 October 2022

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

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

zbMATH Keywords

Hamiltonian connectivityacyclic subdigraphstrongly \(t\)-panconnected tournament

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs
• Weakly quasi-Hamiltonian-set-connected multipartite tournaments
• Hamiltonian-connected tournaments
• Weakly Hamiltonian-connected ordinary multipartite tournaments
• Weakly hamiltonian-connected vertices in bipartite tournaments
• PANCYCLIC ARCS IN HAMILTONIAN CYCLES OF HYPERTOURNAMENTS
• Cycles in digraphs– a survey
• Classes of Directed Graphs
• Digraphs with the path‐merging property
• Weakly Hamiltonian-connected locally semicomplete digraphs
• Strongly Hamiltonian-connected locally semicomplete digraphs
• t-Pancyclic Arcs in Tournaments
• Digraphs
• On Subtournaments of a Tournament
• Cycles of Each Length in Regular Tournaments
• The number of pancyclic arcs in a k‐strong tournament

This page was built for publication: Spanning acyclic subdigraphs and strong \(t\)-panconnectivity of tournaments