Abstract
Let and be integers, let be a graph of order with minimum degree at least . Let be distinct vertices of , and suppose that there exist vertex disjoint cycles in such that for each . Suppose further that the minimum value of the sum of the degrees of two nonadjacent distinct vertices is greater than or equal to . Under these assumptions, we show that there is a 2-factor of with cycles such that for each .
Citation
Toshinori Sakai. "Degree-Sum Conditions for Graphs to Have 2-Factors with Cycles Through Specified Vertices." SUT J. Math. 38 (2) 211 - 222, June 2002. https://doi.org/10.55937/sut/1057898618
Information