Minimum degree, independence number and pseudo [2,b]-factors in graphs
Discrete Mathematics
2012-04-18 v3
Abstract
A pseudo [2,b]-factor of a graph G is a spanning subgraph in which each component C on at least three vertices is a [2,b]-graph. The main contibution of this paper, is to give an upper bound to the number of components that are edges or vertices in a pseudo [2,b]-factor of a graph G. This bound is sharp.
Keywords
Cite
@article{arxiv.1111.3879,
title = {Minimum degree, independence number and pseudo [2,b]-factors in graphs},
author = {Siham Bekkai},
journal= {arXiv preprint arXiv:1111.3879},
year = {2012}
}