Factors and connected factors in tough graphs with high isolated toughness
Combinatorics
2022-05-10 v3
Abstract
Let be a graph and let be a positive integer-valued function on . Assume that for all , where denotes the set of isolated vertices of . In this paper, we show that if for all , and is even, then has a factor such that for each vertex , , where denotes the number of components of . Moreover, we show that if for all , and , then has a connected factor such that for each vertex , .
Cite
@article{arxiv.1812.11640,
title = {Factors and connected factors in tough graphs with high isolated toughness},
author = {Morteza Hasanvand},
journal= {arXiv preprint arXiv:1812.11640},
year = {2022}
}
Comments
The second part of the former version will be published in another paper