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:English
Published: Science & Knowledge Publishing Corporation Limited 2012
Subjects:
Online Access:http://irep.iium.edu.my/27978/
http://irep.iium.edu.my/27978/1/THREE_CONNECTED_CLAW_FREE-JMCS.pdf
_version_ 1848779900454961152
author Saburov, Khikmat
Saburov, Mansoor
author_facet Saburov, Khikmat
Saburov, Mansoor
author_sort Saburov, Khikmat
building IIUM Repository
collection Online Access
description 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.
first_indexed 2025-11-14T15:25:07Z
format Article
id iium-27978
institution International Islamic University Malaysia
institution_category Local University
language English
last_indexed 2025-11-14T15:25:07Z
publishDate 2012
publisher Science & Knowledge Publishing Corporation Limited
recordtype eprints
repository_type Digital Repository
spelling iium-279782013-02-13T21:31:06Z http://irep.iium.edu.my/27978/ Every 3-connected claw-free B_{i;7-i}-free graph is Hamiltonian Saburov, Khikmat Saburov, Mansoor QA Mathematics 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. Science & Knowledge Publishing Corporation Limited 2012 Article PeerReviewed application/pdf en http://irep.iium.edu.my/27978/1/THREE_CONNECTED_CLAW_FREE-JMCS.pdf 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 http://scik.org/index.php/jmcs/article/view/158
spellingShingle QA Mathematics
Saburov, Khikmat
Saburov, Mansoor
Every 3-connected claw-free B_{i;7-i}-free graph is Hamiltonian
title Every 3-connected claw-free B_{i;7-i}-free graph is Hamiltonian
title_full Every 3-connected claw-free B_{i;7-i}-free graph is Hamiltonian
title_fullStr Every 3-connected claw-free B_{i;7-i}-free graph is Hamiltonian
title_full_unstemmed Every 3-connected claw-free B_{i;7-i}-free graph is Hamiltonian
title_short Every 3-connected claw-free B_{i;7-i}-free graph is Hamiltonian
title_sort every 3-connected claw-free b_{i;7-i}-free graph is hamiltonian
topic QA Mathematics
url http://irep.iium.edu.my/27978/
http://irep.iium.edu.my/27978/
http://irep.iium.edu.my/27978/1/THREE_CONNECTED_CLAW_FREE-JMCS.pdf