Decompositions for the edge colouring of reduced indifference graphs

Author： de Figueiredo C.M.H.   Meidanis J.   de Mello C.P.   Ortiz C.  

Publisher： Elsevier

ISSN： 0304-3975

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

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

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. : 91-106

Elsevier

Access to resources Recommend Favorite

Schnyder Decompositions for Regular Plane Graphs and Application to Drawing

By Bernardi Olivier   Fusy Éric  

Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. : 1159-1197

Springer Publishing Company

Access to resources Recommend Favorite

The monadic second-order logic of graphs XI: Hierarchical decompositions of connected graphs

By Courcelle B.  

Theoretical Computer Science, Vol. 224, Iss. 1, 1999-08 ,pp. : 35-58

Elsevier

Access to resources Recommend Favorite

On clique-colouring of graphs with few P 4’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