Partial characterizations of coordinated graphs: line graphs and complements of forests
- 50 Downloads
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 receive the same color is equal to the maximum number of cliques of H with a common vertex, for every induced subgraph H of G. Coordinated graphs are a subclass of perfect graphs. The list of minimal forbidden induced subgraphs for the class of coordinated graphs is not known. In this paper, we present a partial result in this direction, that is, we characterize coordinated graphs by minimal forbidden induced subgraphs when the graph is either a line graph, or the complement of a forest.
KeywordsComplements of forests Coordinated graphs Line graphs Perfect graphs
- Golumbic M (2004) Algorithmic graph theory and perfect graphs, 2nd edn. Annals of Discrete Mathematics, vol 57. North-Holland, AmsterdamGoogle Scholar
- Kőnig D (1931) Graphok és Matrixok. Matematikai és Fizikai Lapok 38: 116–119Google Scholar
- Soulignac F, Sueiro G (2006) Exponential families of minimally non-coordinated graphs (submitted)Google Scholar
- Soulignac F, Sueiro G (2006) NP-hardness of the recognition of coordinated graphs. Ann Oper Res (in press). doi: 10.1007/s10479-008-0392-4