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

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.

PDF ( EVERY 3-CONNECTED CLAW-FREE B{i;7-i}-FREE GRAPH IS HAMILTONIAN) - Published Version Restricted to Registered users only Download (1MB) | Request a copy

Abstract

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

Item Type:	Conference or Workshop Item (Full Paper)
Additional Information:	6769/28027
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:	06 Jan 2013 20:50
Last Modified:	14 Feb 2013 02:43
URI:	http://irep.iium.edu.my/id/eprint/28027

Actions (login required)

View Item