Back to Search
Start Over
On 2-edge-connected -factors of graphs with Ore-type condition
- Source :
-
Discrete Mathematics . Jul2005, Vol. 296 Issue 2/3, p225-234. 10p. - Publication Year :
- 2005
-
Abstract
- Abstract: Let and be two integers. Suppose that G is a 2-edge-connected graph of order with minimum degree at least a. Then G has a 2-edge-connected -factor if every pair of non-adjacent vertices has degree sum at least . This lower bound is sharp. As a consequence, we have Ore-type conditions for the existence of a 2-edge-connected -factor in graphs. [Copyright &y& Elsevier]
- Subjects :
- *ALGEBRA
*GRAPH theory
*COMBINATORICS
*FACTORS (Algebra)
Subjects
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 296
- Issue :
- 2/3
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 18136941
- Full Text :
- https://doi.org/10.1016/j.disc.2005.01.004