Author： Cheng Eddie Qiu Ke Shen Zhizhang
Publisher： Oxford University Press
ISSN： 1460-2067
Source： Computer Journal, Vol.56, Iss.7, 2013-07, pp. : 871-881
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
Embedding k(n-k) edge-disjoint spanning trees in arrangement graphs
By Lin C.-T.
Journal of Parallel and Distributed Computing, Vol. 63, Iss. 12, 2003-12 ,pp. :
Access to resources
Recommend
On edge-colouring indifference graphs
By de Figueiredo C.M.H. Meidanis J. de Mello C.P.
Theoretical Computer Science, Vol. 181, Iss. 1, 1997-07 ,pp. :
A Sequential Algorithm for Generating Random Graphs
By Bayati Mohsen Kim Jeong Saberi Amin
Algorithmica, Vol. 58, Iss. 4, 2010-12 ,pp. :
Edge coloring of bipartite graphs with constraints
By Caragiannis I. Kaklamanis C. Persiano P.
Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. :
List edge multicoloring in graphs with few cycles
By Marx D.
Information Processing Letters, Vol. 89, Iss. 2, 2004-01 ,pp. :