On 2-edge-connected |a, b|-factors of graphs with Ore-type condition

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


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 languageEnglish
Pages (from-to)225-234
Number of pages10
JournalDiscrete Mathematics
Issue number2-3
Publication statusPublished - 2005 Jul 6
Externally publishedYes


  • Connected factor
  • Factor
  • Graph
  • Ore-type
  • |a, b|-factor

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'On 2-edge-connected |a, b|-factors of graphs with Ore-type condition'. Together they form a unique fingerprint.

Cite this