scientific article; zbMATH DE number 1424871
From MaRDI portal
zbMATH Open0949.05509MaRDI QIDQ4945895FDOQ4945895
Authors: Zhengsheng Wu 
Publication date: 26 March 2000
Title of this publication is not available (Why is that?)
Recommendations
Cited In (19)
- On Hamiltonian properties of \(K_{1, r}\)-free split graphs
- Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
- Claw-free graphs---a survey
- Title not available (Why is that?)
- Degree-light-free graphs and Hamiltonian cycles
- Dominating sets and Hamiltonicity in \(K_{1,3}\)-free graphs
- Neighborhood union of independent sets and Hamiltonicity of claw-free graphs
- A necessary and sufficient condition for connected, locally k-connected k1,3-free graphs to be k-hamiltonian
- Hamiltonian cycles in regular 3-connected claw-free graphs
- Title not available (Why is that?)
- Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
- Title not available (Why is that?)
- A generalization of Dirac's theorem for \(K(1,3)\)-free graphs
- On hamiltonian connectedness of \(K_{1,4}\)-free graphs
- 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected
- Hamiltonian property of 3-connected \([5,3]\)-graphs
- The Hamilton-connectivity with the degree sum of non-adjacent subgraphs of claw-free graphs
- Highly Hamiltonian \(K_{1,3}P_4\)-free 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 Q4945895)
