Crossmark

Minimum degree, independence number and pseudo<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mrow><mml:mo>[</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>b</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:math>-factors in graphs

Crossref DOI link: https://doi.org/10.1016/j.dam.2013.09.005

Published Print: 2014-01

Update policy: https://doi.org/10.1016/elsevier_cm_policy

Authors

Bekkai, Siham
License Information

Text and Data Mining valid from 2014-01-01

Version of Record valid from 2018-01-11
More Information

This article is maintained by: Elsevier

Article Title: Minimum degree, independence number and pseudo -factors in graphs

Journal Title: Discrete Applied Mathematics

CrossRef DOI link to publisher maintained version: https://doi.org/10.1016/j.dam.2013.09.005

Content Type: article

Copyright: Copyright © 2013 Elsevier B.V. All rights reserved.

Document is current

Any future updates will be listed below