Decompositions for the edge colouring of reduced indifference graphs

By de Figueiredo C.M.H.   Meidanis J.   de Mello C.P.   Ortiz C.  

Theoretical Computer Science, Vol. 297, Iss. 1, 2003-03 ,pp. : 145-155

Elsevier

Access to resources Recommend Favorite

On clique-colouring of graphs with few P ₄’s

By Klein Sulamita   Morgana Aurora  

Journal of the Brazilian Computer Society, Vol. 18, Iss. 2, 2012-06 ,pp. : 113-119

Springer Publishing Company

Access to resources Recommend Favorite

Near-optimal, distributed edge colouring via the nibble method

By Dubhashi D.   Grable D.A.   Panconesi A.  

Theoretical Computer Science, Vol. 203, Iss. 2, 1998-08 ,pp. : 225-251

Elsevier

Access to resources Recommend Favorite

Edge coloring of bipartite graphs with constraints

By Caragiannis I.   Kaklamanis C.   Persiano P.  

Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. : 361-399

Elsevier

Access to resources Recommend Favorite

List edge multicoloring in graphs with few cycles

By Marx D.  

Information Processing Letters, Vol. 89, Iss. 2, 2004-01 ,pp. : 85-90

Elsevier

Access to resources Recommend Favorite