Title of article
Neighborhood unions and disjoint chorded cycles in graphs
Author/Authors
Qiao، نويسنده , , Shengning، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2012
Pages
7
From page
891
To page
897
Abstract
Let s ≥ 0 , t ≥ 0 be two integers and G be a graph with at least 3 s + 4 t vertices. In this paper, we show that if | N ( u , G ) ∪ N ( v , G ) | ≥ 3 s + 4 t + 1 for any two nonadjacent vertices u and v in G , then G contains s + t vertex-disjoint cycles such that t of them are chorded cycles. The condition is sharp.
Keywords
cycle , Chorded cycle , vertex-disjoint
Journal title
Discrete Mathematics
Serial Year
2012
Journal title
Discrete Mathematics
Record number
1599873
Link To Document