Edge-clique graphs and the lambda-coloring problem
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.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Digital revista |
| Language: | English |
| Published: |
Sociedade Brasileira de Computação
2001
|
| Online Access: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002001000200006 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|