Partial characterizations of coordinated graphs: line graphs and complements of forests · Original Article · Published: 13 September 2008.

In the same direction , coordinated graphs are characterized by minimal forbidden subgraphs for line graphs and complements of forests [5] . In this paper, we ...

Abstract A graph G is coordinated if the minimum number of colors that can be assigned to the cliques of H in such a way that no two cliques with.

A partial result is presented, that is, coordinated graphs are characterized by minimal forbidden induced subgraphs when the graph is either a line graph, ...

"Partial characterizations of coordinated graphs: line graphs and complements of forests," Mathematical Methods of Operations Research, Springer;Gesellschaft ...

A graph G is coordinated if the minimum number of colors that can be assigned to the cliques of H in such a way that no two cliques with non-empty intersection ...

A graph G is coordinated if the minimum number of colors that can be assigned to the cliques of H in such a way that no two cliques with non-empty intersection ...

Abstract: A graph G is coordinated if the minimum number of colors that can be assigned to the cliques of H in such a way that no two cliques with non-empty ...

Partial characterizations of coordinated graphs: line graphs and complements of forests. Abstract A graph G is coordinated if the minimum number of colors ...

Co-authors ; Partial characterizations of coordinated graphs: line graphs and complements of forests. F Bonomo, G Durán, F Soulignac, G Sueiro. Mathematical ...