Threshold-Coloring and Unit-Cube Contact Representation of Graphs

We study threshold coloring of graphs where the vertex colors, represented 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.

[1]  Peter L. Hammer,et al.  Difference graphs , 1990, Discret. Appl. Math..

[2]  N. Mahadev,et al.  Threshold graphs and related topics , 1995 .

[3]  Martin Charles Golumbic,et al.  Graph Sandwich Problems , 1995, J. Algorithms.

[4]  Dieter Rautenbach,et al.  Integral Mixed Unit Interval Graphs , 2012, COCOON.

[5]  Celina M. H. de Figueiredo,et al.  A Linear-Time Algorithm for Proper Interval Graph Recognition , 1995, Inf. Process. Lett..

[6]  Roded Sharan,et al.  A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs , 1999, SIAM J. Comput..

[7]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[8]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[9]  W. K. Hale.  Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.

[10]  W. Marsden.  I and J , 2012 .

[11]  Jirí Fiala,et al.  Systems of distant representatives , 2005, Discret. Appl. Math..

[12]  M. Golumbic,et al.  On the Complexity of DNA Physical Mapping , 1994 .

[13]  Carsten Thomassen,et al.  Interval representations of planar graphs , 1986, J. Comb. Theory, Ser. B.

[14]  Giuseppe Liotta,et al.  On Representing Graphs by Touching Cuboids , 2012, Graph Drawing.

[15]  Stefan Felsner,et al.  Contact representations of planar graphs with cubes , 2011, SoCG '11.

[16]  Jerrold R. Griggs,et al.  Labelling Graphs with a Condition at Distance 2 , 1992, SIAM J. Discret. Math..