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

Haruhide Matsuda

Research output: Contribution to journal › Article

3 Citations (Scopus)

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

Fingerprint

Ores

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

Matsuda, H 2005, 'On 2-edge-connected |a, b|-factors of graphs with Ore-type condition', Discrete Mathematics, vol. 296, no. 2-3, pp. 225-234. https://doi.org/10.1016/j.disc.2005.01.004
Matsuda H. On 2-edge-connected |a, b|-factors of graphs with Ore-type condition. Discrete Mathematics. 2005 Jul 6;296(2-3):225-234. https://doi.org/10.1016/j.disc.2005.01.004
Matsuda, Haruhide. / On 2-edge-connected |a, b|-factors of graphs with Ore-type condition. In: Discrete Mathematics. 2005 ; Vol. 296, No. 2-3. pp. 225-234.
@article{88860a6e48254ac79f61b1c7507e987b,
title = "On 2-edge-connected |a, b|-factors of graphs with Ore-type condition",
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.",
keywords = "Connected factor, Factor, Graph, Ore-type, |a, b|-factor",
author = "Haruhide Matsuda",
year = "2005",
month = "7",
day = "6",
doi = "10.1016/j.disc.2005.01.004",
language = "English",
volume = "296",
pages = "225--234",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "2-3",

}

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

AN - SCOPUS:22144476190

VL - 296

SP - 225

EP - 234

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 2-3

ER -

Access to Document