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

DOI10.46298/DMTCS.11560MaRDI QIDQ6606989zbMATH OpenFDO

Authors Samvel Kh. Darbinyan

Publication date 17 September 2024

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

Copyright license CC0

Full work available at URL https://doi.org/10.46298/DMTCS.11560

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Recommendations

• A sufficient condition for a digraph to be Hamiltonian
• A new sufficient condition for a digraph to be Hamiltonian
• scientific article; zbMATH DE number 908788
• Directed hamiltonian graphs
• Notes on sufficient conditions for a graph to be hamiltonian

Cites work

• A degree condition for cycles of maximum length in bipartite digraphs
• A degree sum condition for Hamiltonicity in balanced bipartite digraphs
• A note on dominating pair degree condition for Hamiltonian cycles in balanced bipartite digraphs
• A short proof of Meyniel's theorem
• A sufficient condition for the hamiltonian property of digraphs with large semi-degrees
• A survey on Hamilton cycles in directed graphs
• Cycles in digraphs– a survey
• Directed Hamilton cycles in digraphs and matching alternating Hamilton cycles in bipartite graphs
• Extremal digraphs on Meyniel-type condition for Hamiltonian cycles in balanced bipartite digraphs
• Extremal digraphs on Woodall‐type condition for Hamiltonian cycles in balanced bipartite digraphs
• Hamiltonian paths in oriented graphs
• scientific article; zbMATH DE number 3833995 (Why is no real title available?)
• scientific article; zbMATH DE number 3149611 (Why is no real title available?)
• scientific article; zbMATH DE number 3310759 (Why is no real title available?)
• Long Cycles in Digraphs
• On dominating pair degree conditions for Hamiltonicity in balanced bipartite digraphs
• On pancyclic digraphs
• On the Meyniel condition for Hamiltonicity in bipartite digraphs
• Recent advances on the Hamiltonian problem: survey III
• Sufficient Conditions for Circuits in Graphs^†

Cited in

(1)

• On Hamiltonian bypasses in orgraphs with large semi-degrees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606989)