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

  • Authors:

  • Mekkia Kouider;Zbigniew Lonc

  • Affiliations:

  • L.R.I., UMR 8623 Bât. 490, Université Paris-Sud, 91405 Orsay Cedex, France;(Performed the study, at L.R.I., Université Paris-Sud.) Faculty of Mathematics and Information Science, Warsaw University of Technology, 00661 Warsaw, Poland

  • Venue:
  • Journal of Graph Theory
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

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,b]-factor, and a 2-connected [a,b]-factor. The conditions involve the minimum degree, the stability number, and the connectivity of a graph. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 254–264, 2004