Skip to Main content Skip to Navigation
Conference papers

On Poset Sandwich Problems

Abstract : A graph $G_s=(V,E_s)$ is a sandwich for a pair of graph $G_t=(V,E_t)$ and $G=(V,E)$ if $E_t\subseteq E_s\subseteq E$. Any poset, or partially ordered set, admits a unique graph representation which is directed and transitive. In this paper we introduce the notion of sandwich poset problems inspired by former sandwich problems on comparability graphs. In particular, we are interested in series-parallel and interval posets which are subclasses of 2-dimensional posets, we describe polynomial algorithms for these two classes of poset sandwich problems and then prove that the problem of deciding the existence of a 2-dimensional sandwich poset is NP-complete.
Document type :
Conference papers
Complete list of metadata
Contributor : Christine Carvalho de Matos <>
Submitted on : Wednesday, February 6, 2019 - 12:57:18 PM
Last modification on : Saturday, September 11, 2021 - 3:19:11 AM


  • HAL Id : lirmm-00269577, version 1


Michel Habib, David Kelly, Emmanuelle Lebhar, Christophe Paul. On Poset Sandwich Problems. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, 2003, Prague, Czech Republic. ⟨lirmm-00269577⟩



Record views