Trees with proper thinness 2

Authors

Keywords:

trees, proper thinness, characterizations

Abstract

The proper thinness of a graph is an invariant that generalizes the concept of a proper interval graph. Every graph has a numerical value of proper thinness and the graphs with proper thinness 1 are exactly the proper interval graphs. In this work we focus on the calculation of proper thinness for trees. We characterize trees of proper thinness 2, both structurally and by their minimal forbidden induced subgraphs. We also show why the results obtained for trees of proper thinness 2 cannot be generalized to trees of proper thinness 3.

Downloads

Published

2025-09-15

Issue

Section

SIIIO-Symposium on Industrial Informatics and Operations Research

How to Cite

Bonomo-Braberman, F., Maqueda, I., & Pardal, N. (2025). Trees with proper thinness 2. JAIIO, Jornadas Argentinas De Informática, 11(14), 306-310. https://revistas.unlp.edu.ar/JAIIO/article/view/19503