![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Publisher: Cambridge University Press
E-ISSN: 1469-2163|26|2|201-207
ISSN: 0963-5483
Source: Combinatorics, Probability & Computing, Vol.26, Iss.2, 2017-03, pp. : 201-207
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
DEGREE DISTANCE AND MINIMUM DEGREE
Bulletin of the Australian Mathematical Society, Vol. 87, Iss. 2, 2013-04 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
A note on graphs with a prescribed adjacency property
Bulletin of the Australian Mathematical Society, Vol. 51, Iss. 1, 1995-02 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Minimum degree and minimum number of edge-disjoint trees
Discrete Mathematics, Vol. 275, Iss. 1, 2004-01 ,pp. :