DISCUSSIONES MATHEMATICAE GRAPH THEORY 37(3) 797-809 2017年8月 [査読有り]
For a graph G and even integers b >= a >= 2, a spanning subgraph F of G such that a <= degF(x) <= b and degF(x) is even for all x is an element of V(F) is called an even [a, b]-factor of G. In this paper, we show that a 2-edge-connecte...
Let a and b be positive integers with a < b. In this paper, we obtain a neighborhood-union condition for the existence of a Hamiltonian [a, b]-factor showing the following result: For a Hamiltonian graph G of sufficiently large order n, if delt...