Cycles in 2-Factors of Balanced Bipartite Graphs
Cycles in 2-Factors of Balanced Bipartite Graphs
复制标题
DOI：
10.1007/s003730050004
复制
发表时间：
2000-03
影响因子：
0.7
通讯作者：
Guantao Chen;R. Faudree;R. Gould;M. Jacobson;L. Lesniak
中科院分区：
文献类型：
--
作者：
Guantao Chen;R. Faudree;R. Gould;M. Jacobson;L. Lesniak
In the study of hamiltonian graphs, many well known results use degree conditions to ensure sufficient edge density for the existence of a hamiltonian cycle. Recently it was shown that the classic degree conditions of Dirac and Ore actually imply far more than the existence of a hamiltonian cycle in a graphG, but also the existence of a 2-factor with exactlykcycles, where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}\end{document}. In this paper we continue to study the number of cycles in 2-factors. Here we consider the well-known result of Moon and Moser which implies the existence of a hamiltonian cycle in a balanced bipartite graph of order 2n. We show that a related degree condition also implies the existence of a 2-factor with exactlykcycles in a balanced bipartite graph of order 2nwith \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}\end{document}.
