Publikace na Matematicko-fyzikální fakulta |
2013
Abstrakt
We study threshold coloring of graphs where the vertex colors, repre- sented by integers, describe any spanning subgraph of the given graph as follows. Pairs of vertices with near colors imply the edge between them is present and pairs of vertices with far colors imply the edge is absent.
Not all planar graphs are threshold-colorable, but several subclasses, such as trees, some planar grids, and planar graphs with no short cycles can always be threshold-colored. Using these results we obtain unit-cube contact representation of several subclasses of planar graphs.
We show the NP-completeness for two variants of the threshold coloring problem and describe a polynomial-time algorithm for another.