scientific article; zbMATH DE number 3867374
From MaRDI portal
Publication:3335818
Recommendations
Cited in
(12)- The necessary and sufficient condition of H-graph and the optimizing models of minimum H-circuit
- One criterion of existence of a Hamiltonian cycle
- Any maximal planar graph with only one separating triangle is Hamiltonian
- Degree sum and connectivity conditions for dominating cycles
- Some necessary conditions for a graph to be Hamiltonian
- A sufficient condition for Hamilton graphs
- scientific article; zbMATH DE number 4177091 (Why is no real title available?)
- scientific article; zbMATH DE number 4043882 (Why is no real title available?)
- scientific article; zbMATH DE number 1150269 (Why is no real title available?)
- scientific article; zbMATH DE number 205869 (Why is no real title available?)
- Graph theory (algorithmic, algebraic, and metric problems)
- A clique-covering sufficient condition for hamiltonicity of graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3335818)