On \(d\)-panconnected tournaments with large semidegrees
From MaRDI portal
Publication:2142665
DOI10.1016/j.disc.2022.112931zbMath1495.05113arXiv2112.08807OpenAlexW4223585870MaRDI QIDQ2142665
Samvel Kh. Darbinyan, Gregory Gutin
Publication date: 27 May 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.08807
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hamiltonian-connected tournaments
- Completely strong path-connected tournaments
- Cycles of all lengths in arc-3-cyclic semicomplete digraphs
- Pancyclic out-arcs of a vertex in tournaments
- A note on min-max pair in tournaments
- Bypasses in asymmetric digraphs
- Tournaments and Semicomplete Digraphs
- Pancyclic arcs and connectivity in tournaments
- Cycles in digraphs– a survey
- Cycles of Each Length in Regular Tournaments
- The number of pancyclic arcs in a k‐strong tournament
This page was built for publication: On \(d\)-panconnected tournaments with large semidegrees