Ore conditions for antistrong digraphs
From MaRDI portal
Publication:6096275
DOI10.1016/j.amc.2023.128181OpenAlexW4380841433MaRDI QIDQ6096275
Publication date: 11 September 2023
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2023.128181
Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx) Designs and configurations (05Bxx)
Cites Work
- Unnamed Item
- Antistrong digraphs
- Antidirected Hamiltonian paths between specified vertices of a tournament
- The antistrong property for special digraph families
- Anti-Eulerian digraphs
- Antidirected Hamilton circuits and paths in tournaments
- Rainbow antistrong connection in tournaments
- Necessary and sufficient conditions for circulant digraphs to be antistrong, weakly-antistrong and anti-Eulerian
- Digraphs
- Antidirected Hamiltonian paths in tournaments
- Antidirected Hamiltonian paths in tournaments
This page was built for publication: Ore conditions for antistrong digraphs