Every 3-connected claw-free B_{i;7-i}-free graph is Hamiltonian
In this paper we have proved 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: | Article |
| Language: | English |
| Published: |
Science & Knowledge Publishing Corporation Limited
2012
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/27978/1/THREE_CONNECTED_CLAW_FREE-JMCS.pdf http://irep.iium.edu.my/27978/ http://scik.org/index.php/jmcs/article/view/158 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this paper we have proved that every 3-connected K_{1;3}B_{2;5} (or K_{1;3}B_{3;4})-free graph is
Hamiltonian. |
|---|