On existence of [a,b]-factors avoiding given subgraphs

2006/11/03 by Yinghong Ma, Ma, Yinghong, Qinglin Yu +1
Mathematics · #05C70 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C70

paper · pdf · doi:10.48550/arxiv.math/0611070

13 pages

arxiv created 2006/11/03 · arxiv updated 2009/12/01

Abstract

For a graph G = (V(G), E(G)), let i(G) be the number of isolated vertices in G. The \it isolated toughness of G is defined as I(G) = min\|S|/i(G-S) : S⊆ V(G), i(G-S)≥ 2\ if G is not complete; I(G)=|V(G)|-1 otherwise. In this paper, several sufficient conditions in terms of isolated toughness are obtained for the existence of [a, b]-factors avoiding given subgraphs, e.g., a set of vertices, a set of edges and a matching, respectively.

Related

• Tight Toughness and Isolated Toughness for \K₂,C_n\-factor critical avoidable graph
• Tight toughness, isolated toughness and binding number bounds for the \K₂,C_n\-factors
• Existence of 2-Factors in Tough Graphs without Forbidden Subgraphs
• Toughness and existence of 2-factors
• Factors and connected factors in tough graphs with high isolated\n toughness