Every 3-connected claw-free B_{i;7-i}-free graph is hamiltonian
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.
Copyright © 2012 Khikmat Saburov, Mansoor Saburov. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
K. Saburov, M. Saburov, Every 3-connected claw-free B_{i;7-i}-free graph is hamiltonian, J. Math. Comput. Sci. 2 (2012), 535–564.
BibTeX
@article{Saburov2012,
author = {Saburov, Khikmat and Saburov, Mansoor},
title = {Every 3-connected claw-free B_{i;7-i}-free graph is hamiltonian},
journal = {J. Math. Comput. Sci.},
volume = {2},
year = {2012},
pages = {535--564},
doi = {}
}