On the thinness and proper thinness of a graph
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 thes...
Guardado en:
| Publicado: |
2018
|
|---|---|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0166218X_v_n_p_Bonomo http://hdl.handle.net/20.500.12110/paper_0166218X_v_n_p_Bonomo |
| Aporte de: |
| id |
paper:paper_0166218X_v_n_p_Bonomo |
|---|---|
| record_format |
dspace |
| spelling |
paper:paper_0166218X_v_n_p_Bonomo2023-06-08T15:15:37Z On the thinness and proper thinness of a graph Interval graphs Proper interval graphs Proper thinness Thinness 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 to 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. © 2018 Elsevier B.V. 2018 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0166218X_v_n_p_Bonomo http://hdl.handle.net/20.500.12110/paper_0166218X_v_n_p_Bonomo |
| institution |
Universidad de Buenos Aires |
| institution_str |
I-28 |
| repository_str |
R-134 |
| collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
| topic |
Interval graphs Proper interval graphs Proper thinness Thinness |
| spellingShingle |
Interval graphs Proper interval graphs Proper thinness Thinness On the thinness and proper thinness of a graph |
| topic_facet |
Interval graphs Proper interval graphs Proper thinness Thinness |
| description |
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 to 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. © 2018 Elsevier B.V. |
| title |
On the thinness and proper thinness of a graph |
| title_short |
On the thinness and proper thinness of a graph |
| title_full |
On the thinness and proper thinness of a graph |
| title_fullStr |
On the thinness and proper thinness of a graph |
| title_full_unstemmed |
On the thinness and proper thinness of a graph |
| title_sort |
on the thinness and proper thinness of a graph |
| publishDate |
2018 |
| url |
https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0166218X_v_n_p_Bonomo http://hdl.handle.net/20.500.12110/paper_0166218X_v_n_p_Bonomo |
| _version_ |
1768545324027084800 |