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

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: Conference or Workshop Item
Language:English
Published: 2012
Subjects:
QA Mathematics
Online Access:http://irep.iium.edu.my/28027/
http://irep.iium.edu.my/28027/
http://irep.iium.edu.my/28027/1/Every_3_Connected-ICMAE2012.pdf
id iium-28027
recordtype eprints
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 Conference or Workshop Item 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/
repository_type Digital Repository
institution_category Local University
institution International Islamic University Malaysia
building IIUM Repository
collection Online Access
language English
topic QA Mathematics
spellingShingle QA Mathematics
Saburov, Khikmat
Ganiev, Inomjon
Saburov, Mansoor
Every 3-connected claw-free b{i;7-i}-free graph is Hamiltonian
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
format Conference or Workshop Item
author Saburov, Khikmat
Ganiev, Inomjon
Saburov, Mansoor
author_facet Saburov, Khikmat
Ganiev, Inomjon
Saburov, Mansoor
author_sort Saburov, Khikmat
title 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_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_sort every 3-connected claw-free b{i;7-i}-free graph is hamiltonian
publishDate 2012
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
first_indexed 2023-09-18T20:41:29Z
last_indexed 2023-09-18T20:41:29Z
_version_ 1777409394440404992

Similar Items