An implicit degree condition for Hamiltonian cycles
From MaRDI portal
Publication:5397240
zbMATH Open1289.05254MaRDI QIDQ5397240FDOQ5397240
Authors: Junqing Cai, Hao Li, Wantao Ning 
Publication date: 19 February 2014
Recommendations
- An implicit degree Dirac condition for Hamiltonian cycles.
- Implicit degree condition for Hamiltonicity of graphs.
- Implicit degree sum condition for Hamiltonian cycles.
- Minimum implicit degree condition restricted to claws for Hamiltonian cycles
- An algorithm for Hamiltonian cycles under implicit degree conditions.
Cited In (19)
- Title not available (Why is that?)
- Hamiltonian degree conditions which imply a graph is pancyclic
- Implicit degree condition for Hamiltonicity of graphs.
- Minimum implicit degree condition restricted to claws for Hamiltonian cycles
- An improved degree based condition for Hamiltonian cycles
- An implicit degree condition for Hamiltonian graphs
- Title not available (Why is that?)
- A sufficient condition involving implicit degree and neighborhood intersection for long cycles
- An algorithm for Hamiltonian cycles under implicit degree conditions.
- An implicit degree condition for cyclability in graphs
- High-order copositive tensors and its applications
- Implicit degree sum condition for Hamiltonian cycles.
- A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs
- An implicit degree condition for pancyclicity of graphs
- Implicit degree condition restricted to essential independent sets for Hamiltonian cycles
- Title not available (Why is that?)
- An implicit degree Dirac condition for Hamiltonian cycles.
- An implicit degree Ore-condition for pancyclicity of graphs
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
This page was built for publication: An implicit degree condition for Hamiltonian cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5397240)
