Abstract
Let a≥2 and t≥2 be two integers. Suppose that G is a 2-edge-connected graph of order |G|≥2(t+1)((a-2)t+a)+t-1 with minimum degree at least a. Then G has a 2-edge-connected [a,at]-factor if every pair of non-adjacent vertices has degree sum at least 2|G|/(1+t). This lower bound is sharp. As a consequence, we have Ore-type conditions for the existence of a 2-edge-connected [a,b]-factor in graphs.
| Original language | English |
|---|---|
| Pages (from-to) | 225-234 |
| Number of pages | 10 |
| Journal | Discrete Mathematics |
| Volume | 296 |
| Issue number | 2-3 |
| DOIs | |
| Publication status | Published - 2005 Jul 6 |
| Externally published | Yes |
Fingerprint
Keywords
- Connected factor
- Factor
- Graph
- Ore-type
- |a, b|-factor
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Theoretical Computer Science
Cite this
On 2-edge-connected |a, b|-factors of graphs with Ore-type condition. / Matsuda, Haruhide.
In: Discrete Mathematics, Vol. 296, No. 2-3, 06.07.2005, p. 225-234.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - On 2-edge-connected |a, b|-factors of graphs with Ore-type condition
AU - Matsuda, Haruhide
PY - 2005/7/6
Y1 - 2005/7/6
N2 - Let a≥2 and t≥2 be two integers. Suppose that G is a 2-edge-connected graph of order |G|≥2(t+1)((a-2)t+a)+t-1 with minimum degree at least a. Then G has a 2-edge-connected [a,at]-factor if every pair of non-adjacent vertices has degree sum at least 2|G|/(1+t). This lower bound is sharp. As a consequence, we have Ore-type conditions for the existence of a 2-edge-connected [a,b]-factor in graphs.
AB - Let a≥2 and t≥2 be two integers. Suppose that G is a 2-edge-connected graph of order |G|≥2(t+1)((a-2)t+a)+t-1 with minimum degree at least a. Then G has a 2-edge-connected [a,at]-factor if every pair of non-adjacent vertices has degree sum at least 2|G|/(1+t). This lower bound is sharp. As a consequence, we have Ore-type conditions for the existence of a 2-edge-connected [a,b]-factor in graphs.
KW - Connected factor
KW - Factor
KW - Graph
KW - Ore-type
KW - |a, b|-factor
UR - http://www.scopus.com/inward/record.url?scp=22144476190&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=22144476190&partnerID=8YFLogxK
U2 - 10.1016/j.disc.2005.01.004
DO - 10.1016/j.disc.2005.01.004
M3 - Article
VL - 296
SP - 225
EP - 234
JO - Discrete Mathematics
JF - Discrete Mathematics
SN - 0012-365X
IS - 2-3
ER -