Every 3-connected claw-free B_{i;7-i}-free graph is hamiltonian

Khikmat Saburov, Mansoor Saburov

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.
Full Text: PDF

How to Cite this Article

Khikmat Saburov, Mansoor Saburov, Every 3-connected claw-free B_{i;7-i}-free graph is hamiltonian, J. Math. Comput. Sci., 2 (2012), 535-564

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.