Abstract
The regular Turan number of a graph F, denoted by rex(n, F), is the largest number of edges in a regular graph G of order n such that G does not conta......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
