This is a preview of subscription content, log in via an institution to check access.
References
K. R. Parthasarathy and G. Ravindra, “The strong perfect graph conjecture is true forK 1,3-free graphs,” J. Combin. Theory Ser. B,21, No. 3, 212–223 (1976).
G. J. Minty, “On maximal independent sets of vertices in claw-free graphs,” J. Combin. Theory Ser. B,28, No. 3, 284–304 (1980).
N. Sbihi, “Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoile,” Discrete Math.,29, No. 1, 53–76 (1980).
R. J. Gould, “Updating the Hamiltonian problem—a survey,” J. Graph Theory,15, No. 2, 121–157 (1991).
J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, North-Holland, Amsterdam (1976).
M. M. Matthews and D. P. Sumner, “Hamiltonian results inK 1,3-free graphs,” J. Graph Theory,8, No. 1, 139–146 (1984).
M. R. Garey, D. S. Johnson, and R. E. Tarjan, “The planar Hamiltonian circuit problem is NP-complete,” SIAM J. Comput.,5, No. 4, 704–714 (1976).
M. D. Plummer and W. R. Pulleyblank, “On proximity to paths and cycles in 3-connected graphs,” Ars Combin.,14, 169–185 (1982).
D. J. Oberly and D. P. Sumner, “Every connected, locally connected nontrivial graph with no induced claw is Hamiltonian,” J. Graph Theory,3, No. 4, 351–356 (1979).
M. M. Matthews and D. P. Sumner, “Longest paths and cycles inK 1,3-free graphs,” J. Graph Theory,9, No. 2, 269–277 (1985).
R. J. Gould, Traceability in Graphs, Ph. D. Thesis, Western Michigan Univ. (1979).
C. Q. Zhang, “Hamilton cycles in claw-free graphs,” J. Graph Theory,12, No. 2, 209–216 (1988).
H. J. Brersma, Sufficient Conditions for Hamiltonicity and Traceability ofK1,3-Free Graphs [Preprint] (1986).
R. J. Faudree, R. J. Gould, M. S. Jacobson, L. M. Lesniak, and T. E. Lindquester, “A generalization of Dirac's theorem forK 1,3-free graphs,” Period. Math. Hungar.,24, No. 1, 37–54 (1992).
Author information
Authors and Affiliations
Additional information
The research was supported by the Russian Foundation for Fundamental Research (Grant 93-011-1486).
Translated from Sibirskii Matematicheskii, Vol. 35, No. 3, pp. 475–479, May–June, 1994.
Rights and permissions
About this article
Cite this article
Ageev, A.A. Dominating sets and hamiltonicity inK 1,3-free graphs. Sib Math J 35, 421–425 (1994). https://doi.org/10.1007/BF02104806
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02104806