Every 3-connected claw-free b{i;7-i}-free graph is Hamiltonian
In this paper we will proof that every 3-connected K{1;3}B{2;5} (or K{1;3}B{3;4})-free graph is Hamiltonian
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/28027/1/Every_3_Connected-ICMAE2012.pdf http://irep.iium.edu.my/28027/ http://www.iium.edu.my/icmae/12/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|