Precedence thinness in graphs

DOI10.1016/J.DAM.2021.05.020MaRDI QIDQ6344135arXivFDO

Authors Flavia Bonomo, Fabiano S. Oliveira, Moysés S. Jr. Sampaio, Jayme L. Szwarcfiter

Publication date 30 June 2020

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.DAM.2021.05.020

Mathematics Subject Classification ID

Graph theory (05Cxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

arXiv classification

cs.DMmath.CO

Abstract: 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 $k$ interval graphs, by splitting the graph in some special way. As a recent example of such an approach, the classes of $k$-thin and proper $k$-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 $kgeq2$. In this work, we introduce a subclass of $k$-thin graphs (resp. proper $k$-thin graphs), called precedence $k$-thin graphs (resp. precedence proper $k$-thin graphs). Concerning partitioned precedence $k$-thin graphs, we present a polynomial time recognition algorithm based on $PQ$-trees. With respect to partitioned precedence proper $k$-thin graphs, we prove that the related recognition problem is NP-complete for an arbitrary $k$ and polynomial-time solvable when $k$ is fixed. Moreover, we present a characterization for these classes based on threshold graphs.

This page was built for publication: Precedence thinness in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6344135)