374 research outputs found
Precedence thinness in graphs
Interval and proper interval graphs are very well-known graph classes, for
which there is a wide literature. As a consequence, some generalizations of
interval graphs have been proposed, in which graphs in general are expressed in
terms of interval graphs, by splitting the graph in some special way.
As a recent example of such an approach, the classes of -thin and proper
-thin graphs have been introduced generalizing interval and proper interval
graphs, respectively. The complexity of the recognition of each of these
classes is still open, even for fixed .
In this work, we introduce a subclass of -thin graphs (resp. proper
-thin graphs), called precedence -thin graphs (resp. precedence proper
-thin graphs). Concerning partitioned precedence -thin graphs, we present
a polynomial time recognition algorithm based on -trees. With respect to
partitioned precedence proper -thin graphs, we prove that the related
recognition problem is \NP-complete for an arbitrary and polynomial-time
solvable when is fixed. Moreover, we present a characterization for these
classes based on threshold graphs.Comment: 33 page
Thinness of product graphs
The thinness of a graph is a width parameter that generalizes some properties
of interval graphs, which are exactly the graphs of thinness one. Many
NP-complete problems can be solved in polynomial time for graphs with bounded
thinness, given a suitable representation of the graph. In this paper we study
the thinness and its variations of graph products. We show that the thinness
behaves "well" in general for products, in the sense that for most of the graph
products defined in the literature, the thinness of the product of two graphs
is bounded by a function (typically product or sum) of their thinness, or of
the thinness of one of them and the size of the other. We also show for some
cases the non-existence of such a function.Comment: 45 page
Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete
The computational complexity of the MaxCut problem restricted to interval
graphs has been open since the 80's, being one of the problems proposed by
Johnson on his Ongoing Guide to NP-completeness, and has been settled as
NP-complete only recently by Adhikary, Bose, Mukherjee and Roy. On the other
hand, many flawed proofs of polynomiality for MaxCut on the more restrictive
class of unit/proper interval graphs (or graphs with interval count 1) have
been presented along the years, and the classification of the problem is still
unknown. In this paper, we present the first NP-completeness proof for MaxCut
when restricted to interval graphs with bounded interval count, namely graphs
with interval count 4
- …