论文信息 - Degree sum conditions and vertex-disjoint cycles in a graph

Degree sum conditions and vertex-disjoint cycles in a graph

We consider degree sum conditions and the existence of vertex-disjoint cycles in a graph. In this paper, we prove the following: Suppose that G is a graph of order at least 3k + 2 and σ3(G) ≥ 6k − 2, where k ≥ 2. Then G contains k vertex-disjoint cycles. The degree and order conditions are sharp.

Shinya Fujita | Hajime Matsumura | Tomoki Yamashita | Masao Tsugaki

[1] Andras Hajnal,et al. On the maximal number of independent circuits in a graph , 1963 .

[2] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[3] Hong Wang,et al. On the maximum number of independent cycles in a graph , 1999, Discret. Math..

[4] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[5] Hikoe Enomoto,et al. On the Existence of Disjoint Cycles in a Graph , 1998, Comb..

[6] P. Justesen,et al. On Independent Circuits in Finite Graphs and a Conjecture of Erdös and Pósa. , 1988 .