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

Haruhide Matsuda

doi:10.1016/j.disc.2005.01.004

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

Haruhide Matsuda

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	225-234
Number of pages	10
Journal	Discrete Mathematics
Volume	296
Issue number	2-3
DOIs	https://doi.org/10.1016/j.disc.2005.01.004
Publication status	Published - 2005 Jul 6
Externally published	Yes

Keywords

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

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2005.01.004

Cite this

@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 = jul,

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 -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this