Edge-clique graphs and the lambda-coloring problem

AUTOR(ES)

Calamoneri, Tiziana, Petreschi, Rossella

FONTE

Journal of the Brazilian Computer Society

DATA DE PUBLICAÇÃO

2001

RESUMO

This paper deals with edge-clique graphs and with the lambda-coloring problem when restricted to this class. A characterization of edge-clique graphs of out-erplanar graphs is given; a complete description of edge-clique graphs of threshold graphs is presented and a linear time algorithm for lambda-coloring the edge-clique graph of a threshold graph is provided. A survey on the lambda-coloring problem, when restricted to edge-clique graphs, is reported.

Documentos Relacionados

• Coloração de arestas em grafos split
• RELATIONSHIP BETWEEN EQUITABLE TOTAL COLORING AND RANGE COLORING IN SOME REGULAR GRAPHS
• Helly property, clique graphs, complementary graph classes, and sandwich problems
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM*
• NEW HEURISTICS FOR THE PROBLEM OF CLIQUE PARTITIONING OF GRAPHS