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

Saburov, Khikmat and Saburov, Mansoor (2012) Every 3-connected claw-free B_{i;7-i}-free graph is Hamiltonian. Journal of Mathematical and Computational Science, 2 (3). pp. 535-564. ISSN 1927-5307

PDF (Every 3-connected claw-free B_{i;7-i}-free graph is Hamiltonian ) - Published Version Restricted to Registered users only Download (412kB) | Request a copy

Abstract

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.

Item Type:	Article (Journal)
Uncontrolled Keywords:	Claw-free graph; forbidden graphs; Hamiltonian graphs; k-stabilizer.
Subjects:	Q Science > QA Mathematics
Kulliyyahs/Centres/Divisions/Institutes (Can select more than one option. Press CONTROL button):	Kulliyyah of Science > Department of Computational and Theoretical Sciences
Depositing User:	Dr Mansoor Saburov
Date Deposited:	30 Dec 2012 10:29
Last Modified:	14 Feb 2013 05:31
URI:	http://irep.iium.edu.my/id/eprint/27978

Actions (login required)

View Item