On the thinness and proper thinness of a graph
arXiv:1704.00379 · doi:10.1016/j.dam.2018.03.072
Abstract
Graphs with bounded thinness were defined in 2007 as a generalization of interval graphs. In this paper we introduce the concept of proper thinness, such that graphs with bounded proper thinness generalize proper interval graphs. We study the complexity of problems related to the computation of these parameters, describe the behavior of the thinness and proper thinness under three graph operations, and relate thinness and proper thinness with other graph invariants in the literature. Finally, we describe a wide family of problems that can be solved in polynomial time for graphs with bounded thinness, generalizing for example list matrix partition problems with bounded size matrix, and enlarge this family of problems for graphs with bounded proper thinness, including domination problems.
Cited by in corpus (6)
- Solving Problems on Generalized Convex Graphs via Mim-Width
- Thinness of product graphs
- Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs
- Precedence thinness in graphs
- On the thinness of trees
- Thinness and its variations on some graph families and coloring graphs of bounded thinness