A new sufficient condition for a digraph to be Hamiltonian

DOI10.1016/S0166-218X(99)00065-7MaRDI QIDQ1302145zbMATH OpenOpenAlexFDO

Authors Yubao Guo, A. Yeo, Jørgen Bang-Jensen

Publication date 9 April 2000

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(99)00065-7

zbMATH Keywords

digraphHamiltonian

Mathematics Subject Classification ID

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

Recommendations

• A dominated pair condition for a digraph to be Hamiltonian
• scientific article; zbMATH DE number 908788
• A degree condition for Hamiltonian digraphs
• A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture

Cited in

(25)

• Pancyclism and Meyniel's conditions
• A sufficient condition for oriented graphs to be Hamiltonian
• Notes on sufficient conditions for a graph to be hamiltonian
• Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem
• Quasi-Hamiltonicity: A series of necessary conditions for a digraph to be Hamiltonian
• Sufficient conditions for a balanced bipartite digraph to be even pancyclic
• Sufficient conditions for Hamiltonian cycles in bipartite digraphs
• A dominated pair condition for a digraph to be Hamiltonian
• A degree sum condition for Hamiltonicity in balanced bipartite digraphs
• A Meyniel-type condition for bipancyclicity in balanced bipartite digraphs
• scientific article; zbMATH DE number 7225861 (Why is no real title available?)
• A sufficient condition for a digraph to be Hamiltonian
• Directed hamiltonian graphs
• A survey on Hamilton cycles in directed graphs
• scientific article; zbMATH DE number 1334635 (Why is no real title available?)
• A sufficient condition for the hamiltonian property of digraphs with large semi-degrees
• Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs
• scientific article; zbMATH DE number 908788 (Why is no real title available?)
• A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture
• New necessary and sufficient condition and algorithm for directed hamiltonian graph based on boolean determinant theory
• On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li
• Preface
• A new sufficient condition for a 2-strong digraph to be Hamiltonian
• A new sufficient condition for hamiltonicity of graphs
• A sufficient condition for cyclability in directed graphs

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

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