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.

Bibliographic Details

Main Authors:	Saburov, Khikmat, Saburov, Mansoor
Format:	Article
Language:	en
Published:	Science & Knowledge Publishing Corporation Limited 2012
Subjects:	QA Mathematics
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!