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

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

Bibliographic Details
Main Authors: Saburov, Khikmat, Ganiev, Inomjon, Saburov, Mansoor
Format: Proceeding Paper
Language:English
Published: 2012
Subjects:
Online Access:http://irep.iium.edu.my/28027/
http://irep.iium.edu.my/28027/1/Every_3_Connected-ICMAE2012.pdf
_version_ 1848779907254976512
author Saburov, Khikmat
Ganiev, Inomjon
Saburov, Mansoor
author_facet Saburov, Khikmat
Ganiev, Inomjon
Saburov, Mansoor
author_sort Saburov, Khikmat
building IIUM Repository
collection Online Access
description 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
first_indexed 2025-11-14T15:25:14Z
format Proceeding Paper
id iium-28027
institution International Islamic University Malaysia
institution_category Local University
language English
last_indexed 2025-11-14T15:25:14Z
publishDate 2012
recordtype eprints
repository_type Digital Repository
spelling iium-280272013-02-13T18:43:34Z http://irep.iium.edu.my/28027/ Every 3-connected claw-free b{i;7-i}-free graph is Hamiltonian Saburov, Khikmat Ganiev, Inomjon Saburov, Mansoor QA Mathematics 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 2012-07-03 Proceeding Paper PeerReviewed application/pdf en http://irep.iium.edu.my/28027/1/Every_3_Connected-ICMAE2012.pdf Saburov, Khikmat and Ganiev, Inomjon and Saburov, Mansoor (2012) Every 3-connected claw-free b{i;7-i}-free graph is Hamiltonian. In: 2nd International Conference on Mathematical Applications in Engineering (ICMAE 2012), 3 - 5 July 2012, Kuala Lumpur. http://www.iium.edu.my/icmae/12/
spellingShingle QA Mathematics
Saburov, Khikmat
Ganiev, Inomjon
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/28027/
http://irep.iium.edu.my/28027/
http://irep.iium.edu.my/28027/1/Every_3_Connected-ICMAE2012.pdf