
Intersection models and forbidden pattern characterizations for 2thin and proper 2thin graphs
The thinness of a graph is a width parameter that generalizes some prope...
read it

The Neighborhood Polynomial of Chordal Graphs
The neighborhood polynomial of a graph G is the generating function of s...
read it

Construction of kmatchings and kregular subgraphs in graph products
A kmatching M of a graph G=(V,E) is a subset M⊆ E such that each connec...
read it

Towards a General Direct Product Testing Theorem
The Direct Product encoding of a string a∈{0,1}^n on an underlying domai...
read it

Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time
In the quest for a logic capturing PTime the next natural classes of str...
read it

Machine Learning approaches to do size based reasoning on Retail Shelf objects to classify product variants
There has been a surge in the number of Machine Learning methods to anal...
read it

Morphological Matrices as a Tool for Crowdsourced Ideation
Designing a novel product is a difficult task not well suited for nonex...
read it
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 NPcomplete 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 nonexistence of such a function.
READ FULL TEXT
Comments
There are no comments yet.