Title of article
On 2-edge-connected image-factors of graphs with Ore-type condition Original Research Article
Author/Authors
Haruhide Matsuda، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
10
From page
225
To page
234
Abstract
Let image and image be two integers. Suppose that G is a 2-edge-connected graph of order image with minimum degree at least a. Then G has a 2-edge-connected image-factor if every pair of non-adjacent vertices has degree sum at least image. This lower bound is sharp. As a consequence, we have Ore-type conditions for the existence of a 2-edge-connected image-factor in graphs.
Keywords
b]-factor , Graph , Factor , Connected factor , Ore-type
Journal title
Discrete Mathematics
Serial Year
2005
Journal title
Discrete Mathematics
Record number
948351
Link To Document