Classical conditions for (weakly-)antistrong digraphs
- 10 June 2025
- journal article
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 507
Abstract
No abstract availableFunding Information
- Xinjiang Uygur Autonomous Region Natural Science Foundation (2020D04046, 2021D01C116)
This publication has 8 references indexed in Scilit:
- Necessary and Sufficient Conditions for Circulant Digraphs to be Antistrong, Weakly-Antistrong and Anti-EulerianGraphs and Combinatorics, 2023
- The Antistrong Property for Special Digraph FamiliesGraphs and Combinatorics, 2021
- Rainbow Antistrong Connection in TournamentsGraphs and Combinatorics, 2020
- Antistrong digraphsJournal of Combinatorial Theory, Series B, 2017
- Antidirected hamiltonian paths between specified vertices of a tournamentDiscrete Applied Mathematics, 2002
- Antidirected Hamiltonian circuits in tournamentsJournal of Combinatorial Theory, Series B, 1974
- Antidirected Hamilton circuits and paths in tournamentsMathematische Annalen, 1973
- Antidirected Hamiltonian paths in tournamentsJournal of Combinatorial Theory, Series B, 1971