Thinness and its variations on some graph families and coloring graphs of bounded thinness
share
Interval graphs and proper interval graphs are well known graph classes, for which there have been proposed several generalizations in the literature. In this work, we study the (proper) k-thin graphs and its variations for the classes of cographs, crown graphs and grid graphs. We provide the exact values for several variants of thinness (proper, independent, complete, precedence, and combinations of them) for the crown graphs CR_n. For cographs, we prove that the precedence thinness can be determined in polynomial time. We also improve known bounds for the thinness of n × n grids GR_n and m × n grids GR_m,n, proving that ⌈n-1/3⌉≤(GR_n) ≤⌈n+1/2⌉. Regarding the precedence thinness, we prove that (GR_n,2) = ⌈n+1/2⌉ and that ⌈n-1/3⌉⌈n-1/2⌉ + 1 ≤(GR_n) ≤⌈n-1/2⌉^2+1. As applications, we show that the k-coloring problem is NP-complete for precedence 2-thin graphs and for proper 2-thin graphs, when k is part of the input. On the positive side, it is polynomially solvable for precedence proper 2-thin graphs, given the order and partition.
READ FULL TEXT