Every 3-connected claw-free b{i;7-i}-free graph is Hamiltonian

• Main Authors: Saburov, Khikmat, Ganiev, Inomjon, Saburov, Mansoor
• Format: Conference or Workshop Item
• Language: English
• Published: 2012
• Subjects: QA Mathematics
• 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/
• Institution: Universiti Islam Antarabangsa Malaysia

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