✦ LIBER ✦

[a, b]-factors of graphs

✍ Scribed by Mikio Kano; Akira Saito

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 303 KB
Volume: 47
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(83)90077-8

No coin nor oath required. For personal study only.

✦ Synopsis

For integers a and b such that 0~ Q < b, a graph G is called an [a, b]-graph if a s c&(x) s b for every vertex x of G and a factor F of a graph is called an [a, b]-factor if a s d&) i b for every vertex x of F. We prove the following theorems. Let 0 c 1 d k s r, 0 s s, 0 G u and 1 d t. Then an [r, r + s]-graph has a [k, k + t]-factor if ks d rt. Moreover, if (k -0s + (r -k)u ~(rl)t, then an [r, r + s]-graph has a [k, k + t]-factor which contains a given [I, 1+ u]-factor.

📜 SIMILAR VOLUMES

[a,b]-factorizations of graphs

✍ Cai Mao-Cheng 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 610 KB

## Abstract Let __a__ and __b__ be integers with __b__ ⩾ __a__ ⩾ 0. A graph __G__ is called an [__a,b__]‐graph if __a__ ⩽ __d__~__G__~(__v__) ⩽ __b__ for each vertex __v__ ∈ __V__(__G__), and an [__a,b__]‐factor of a graph __G__ is a spanning [__a,b__]‐subgraph of __G__. A graph is [__a,b__]‐factor

[a,b]-factorization of a graph

✍ Mikio Kano 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 781 KB

Let a and b be integers such that 0 s a s b. Then a graph G is called an [a,bl-graph if a 6 dG(x) s b for every x E V(G), and an [a,b]-factor of a graph is defined to be its spanning subgraph F such that a d dF(x) d b for every vertex x, where dG(x) and dJx) denote the degrees of x in G and F, respe

Stability number and [a,b]-factors in gr

Stability number and [a,b]-factors in graphs

✍ Mekkia Kouider; Zbigniew Lonc 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB

## Abstract A spanning subgraph whose vertices have degrees belonging to the interval [__a,b__], where __a__ and __b__ are positive integers, such that __a__ ≤ __b__, is called an [__a,b__]‐factor. In this paper, we prove sufficient conditions for existence of an [__a,b__]‐factor, a connected [__a,

Chromatic factorizations of a graph

✍ S. Louis Hakimi; Edward F. Schmeichel 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB

Let n, 2 n2 L . . B n, 2 2 be integers. We say that G has an (n,, n2, , . , , n,)-chromatic factorization if G can be edge-factored as G, @ G2 @ + . . @ G, with x ( G , ) = n,, for i = 1,2, . . . , k . The following results are proved : then K,, has an (n,, n2,, . , , n,)-chromatic factorization. W

A degree condition for a graph to have [

A degree condition for a graph to have [a,b]-factors

✍ Li, Yanjun; Mao-cheng, Cai 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB 👁 2 views

Let G be a graph of order n, and let a and b be integers such that a+b for any two nonadjacent vertices u and v in G. This result is best possible, and it is an extension of T. Iida and T. Nishimura's results (T. Iida and T. Nishimura, An Ore-type condition for the existence of k-factors in graphs,

Restricted b-factors in bipartite graphs

Restricted b-factors in bipartite graphs and t-designs

✍ Ivette Arámbula; Illya V. Hicks 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 178 KB

## Abstract We present a new equivalence result between restricted __b__‐factors in bipartite graphs and combinatorial __t__‐designs. This result is useful in the construction of __t__‐designs by polyhedral methods. We propose a novel linear integer programming formulation, which we call GDP, for t