Linear-semiorders and their incomparability graphs
Discrete Mathematics
2021-05-11 v2 Combinatorics
Abstract
A linear-interval order is the intersection of a linear order and an interval order. For this class of orders, several structural results have been known. This paper introduces a new subclass of linear-interval orders. We call a partial order a \emph{linear-semiorder} if it is the intersection of a linear order and a semiorder. We show a characterization and a polynomial-time recognition algorithm for linear-semiorders. We also prove that being a linear-semiorder is a comparability invariant, showing that incomparability graphs of linear-semiorders can be recognized in polynomial time.
Cite
@article{arxiv.1907.07845,
title = {Linear-semiorders and their incomparability graphs},
author = {Asahi Takaoka},
journal= {arXiv preprint arXiv:1907.07845},
year = {2021}
}
Comments
28 pages