Minimal proper interval completions

Abstract

Given an arbitrary graph and a proper interval graph with we say that H is a proper interval completion of G. The graph H is called a minimal proper interval completion of G if, for any sandwich graph with , is not a proper interval graph. In this paper we give a time algorithm computing a minimal proper interval completion of an arbitrary graph. The output is a proper interval model of the completion.