Minimum degree, independence number and pseudo [2,b]-factors in graphs

Authors:
Siham Bekkai
Affiliations:
-
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 4
Cited 0

Graph partition problems into cycles and paths

Discrete Mathematics
Graph Theory With Applications

Graph Theory With Applications
Stability number and [a,b]-factors in graphs

Journal of Graph Theory
On pseudo 2-factors

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

A pseudo [2,b]-factor of a graph G is a spanning subgraph in which each component C on at least three vertices verifies 2@?d"C(x)@?b, for every vertex x in C. Given an integer b=4, we show that a graph G with minimum degree @d, independence number @ab(@d-1)2 and without isolated vertices possesses a pseudo [2,b]-factor with at most @a-@?b2(@d-1)@? components that are edges or vertices. This bound is sharp.