Covering of Vertices of A Simple Graph With Given Connectivity and stability Number
暂无分享,去创建一个
A. Germa | R. Häggkvist | D. Amar | R. Häggkvist | I. Fournier | D. Amar | I. Fournier | A. Germa
[1] Paul Erdös,et al. A note on Hamiltonian circuits , 1972, Discret. Math..