A Hamiltonian k-factor is a k-factor containing aHamiltonian cycle.An n/2-critical graph G is a simple graph of order n which satisfies δ(G)≥n/2 and δ(G-e)<n/2 for any edge e∈E(G).Let k≥2 be an integer and G b...A Hamiltonian k-factor is a k-factor containing aHamiltonian cycle.An n/2-critical graph G is a simple graph of order n which satisfies δ(G)≥n/2 and δ(G-e)<n/2 for any edge e∈E(G).Let k≥2 be an integer and G be an n/2-critical graph of even order n≥8k-14.It is shown in this paper that for any given Hamiltonian cycle C except that G-C consists of two components of odd orders when k is odd,G has a k-factor containing C.展开更多
基金This research is supported partially by the National Natural Science Foundation of China.
文摘A Hamiltonian k-factor is a k-factor containing aHamiltonian cycle.An n/2-critical graph G is a simple graph of order n which satisfies δ(G)≥n/2 and δ(G-e)<n/2 for any edge e∈E(G).Let k≥2 be an integer and G be an n/2-critical graph of even order n≥8k-14.It is shown in this paper that for any given Hamiltonian cycle C except that G-C consists of two components of odd orders when k is odd,G has a k-factor containing C.
