scientific article; zbMATH DE number 5936422
From MaRDI portal
Publication:3020847
zbMATH Open1283.05159MaRDI QIDQ3020847FDOQ3020847
Authors: Bing Wang 
Publication date: 5 August 2011
Title of this publication is not available (Why is that?)
Recommendations
- Not every 2-tough graph is Hamiltonian
- Toughness, minimum degree, and the existence of 2‐factors
- On toughness and Hamiltonicity of \(2K_{2}\)-free graphs
- Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs
- scientific article; zbMATH DE number 1124477
- scientific article; zbMATH DE number 861334
- Toughness and the existence of Hamiltonian \([a, b]\)-factors of graphs
- Toughness, hamiltonicity and split graphs
- Hamiltonian cycles in 3-tough \(2K_2\)-free graphs
- Hamiltonian cycles in tough \((P_2\cup P_3)\)-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 Q3020847)
