A new sufficient condition for a digraph to be Hamiltonian
From MaRDI portal
Publication:1302145
DOI10.1016/S0166-218X(99)00065-7zbMATH Open0933.05095OpenAlexW2076404940MaRDI QIDQ1302145FDOQ1302145
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
Recommendations
Cited In (21)
- Title not available (Why is that?)
- A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture
- Sufficient conditions for Hamiltonian cycles in bipartite digraphs
- A degree sum condition for Hamiltonicity in balanced bipartite digraphs
- A new sufficient condition for hamiltonicity of graphs
- Title not available (Why is that?)
- A Meyniel-type condition for bipancyclicity in balanced bipartite digraphs
- Directed hamiltonian graphs
- Quasi-Hamiltonicity: A series of necessary conditions for a digraph to be Hamiltonian
- Preface
- A sufficient condition for a digraph to be Hamiltonian
- New necessary and sufficient condition and algorithm for directed hamiltonian graph based on boolean determinant theory
- A survey on Hamilton cycles in directed graphs
- A sufficient condition for cyclability in directed graphs
- Title not available (Why is that?)
- A dominated pair condition for a digraph to be Hamiltonian
- A sufficient condition for the hamiltonian property of digraphs with large semi-degrees
- Sufficient conditions for a balanced bipartite digraph to be even pancyclic
- Pancyclism and Meyniel's conditions
- On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li
- A sufficient condition for oriented graphs to be Hamiltonian
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)
