pith. sign in

arxiv: 1801.03413 · v3 · pith:BHZJOR73new · submitted 2018-01-10 · 🧮 math.CO · cs.DM

Characterizing subclasses of cover-incomparability graphs by forbidden subposets

classification 🧮 math.CO cs.DM
keywords citecover-incomparabilitygraphsbresbres3characterizationsforbiddenordered
0
0 comments X
read the original abstract

In this paper we continue investigations of cover-incomparability graphs of finite partially ordered sets (see \cite{Bres,Bres2,Bres3,Bres4} and \cite{Max,MaxDH}). We consider in some detail the distinction between cover-preserving subsets and isometric subsets of a partially ordered set. This is critical to understanding why forbidden subposet characterizations of certain classes of cover-incomparability graphs in \cite{Bres} and \cite{Bres3} are not valid as presented. Here we provide examples, investigate the root of the difficulties, and formulate and prove valid revisions of these characterizations.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.