Author： Cranston Daniel Kim Seog-Jin Yu Gexin
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.60, Iss.3, 2011-07, pp. : 553-568
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Almost all graphs with average degree 4 are 3-colorable
Journal of Computer and System Sciences, Vol. 67, Iss. 2, 2003-09 ,pp. :
Access to resources
Recommend
Efficient algorithms for acyclic colorings of graphs
By Chen Z.-Z.
Theoretical Computer Science, Vol. 230, Iss. 1, 2000-01 ,pp. :
Finite-dimensional T-colorings of graphs
By Yeh
Theoretical Computer Science, Vol. 263, Iss. 1, 2001-07 ,pp. :
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. :
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. :