Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs
2011
An hourglass is the only graph with degree sequence 4, 2, 2, 2, 2 (i.e. two triangles meeting in exactly one vertex). There are infinitely many claw-free graphs G such that G is not hamiltonian con...
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI