Premium
Stability number and [ a,b ]‐factors in graphs
Author(s) -
Kouider Mekkia,
Lonc Zbigniew
Publication year - 2004
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20008
Subject(s) - combinatorics , mathematics , discrete mathematics , graph
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