![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Achlioptas D. Moore C.
Publisher: Elsevier
ISSN: 0022-0000
Source: Journal of Computer and System Sciences, Vol.67, Iss.2, 2003-09, pp. : 441-471
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)
Injective Colorings of Graphs with Low Average Degree
By Cranston Daniel Kim Seog-Jin Yu Gexin
Algorithmica, Vol. 60, Iss. 3, 2011-07 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
The greedy algorithm for domination in graphs of maximum degree 3
By Seager S.M.
Information Processing Letters, Vol. 89, Iss. 2, 2004-01 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Constructing the highest degree subgraph for dense graphs is in NCAS
By Andreev A.E. Clementi A.E.F. Rolim J.D.P.
Theoretical Computer Science, Vol. 161, Iss. 1, 1996-07 ,pp. :