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

DOI10.46298/DMTCS.11560zbMATH Open1545.05084MaRDI QIDQ6606989FDOQ6606989

Authors: Samvel Kh. Darbinyan 

Publication date: 17 September 2024

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

zbMATH Keywords

Hamiltonian cycledigraphdegreeHamiltonian-connected graph\(k\)-strong graph

Mathematics Subject Classification ID

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

Cites Work

• A survey on Hamilton cycles in directed graphs
• A short proof of Meyniel's theorem
• Title not available (Why is that?)
• Recent advances on the Hamiltonian problem: survey III
• Sufficient Conditions for Circuits in Graphs^†
• Cycles in digraphs– a survey
• A degree condition for cycles of maximum length in bipartite digraphs
• Title not available (Why is that?)
• Hamiltonian paths in oriented graphs
• On pancyclic digraphs
• Long Cycles in Digraphs
• A sufficient condition for the hamiltonian property of digraphs with large semi-degrees
• On the Meyniel condition for hamiltonicity in bipartite digraphs
• Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs
• A degree sum condition for Hamiltonicity in balanced bipartite digraphs
• A note on dominating pair degree condition for Hamiltonian cycles in balanced bipartite digraphs
• On dominating pair degree conditions for Hamiltonicity in balanced bipartite digraphs
• 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
• Title not available (Why is that?)

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)