Clique coloring B1-EPG graphs
We consider the problem of clique coloring, that is, coloring the vertices of a given graph such that no (maximal) clique of size at least two is monocolored. It is known that interval graphs are 2-clique colorable. In this paper we prove that B1-EPG graphs (edge intersection graphs of paths on a gr...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2017 |
| País: | Argentina |
| Institución: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repositorio: | CONICET Digital (CONICET) |
| Idioma: | inglés |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/56526 |
| Acceso en línea: | http://hdl.handle.net/11336/56526 |
| Access Level: | acceso abierto |
| Palabra clave: | CLIQUE COLORING EDGE INTERSECTION GRAPHS PATHS ON GRIDS POLYNOMIAL TIME ALGORITHM https://purl.org/becyt/ford/1.2 https://purl.org/becyt/ford/1 https://purl.org/becyt/ford/1.1 |
| Sumario: | We consider the problem of clique coloring, that is, coloring the vertices of a given graph such that no (maximal) clique of size at least two is monocolored. It is known that interval graphs are 2-clique colorable. In this paper we prove that B1-EPG graphs (edge intersection graphs of paths on a grid, where each path has at most one bend) are 4-clique colorable. Moreover, given a B1-EPG representation of a graph, we provide a linear time algorithm that constructs a 4-clique coloring of it. |
|---|