A new sufficient condition for a 2-strong digraph to be Hamiltonian

DOI10.46298/dmtcs.11560zbMath1545.05084MaRDI QIDQ6606989

Samvel Kh. Darbinyan

Publication date: 17 September 2024

Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

zbMATH Keywords

digraphdegreeHamiltonian cycleHamiltonian-connected graph\(k\)-strong graph

Mathematics Subject Classification ID

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

This page was built for publication: A new sufficient condition for a 2-strong digraph to be Hamiltonian