Tree-Visibility Orders - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1995

Tree-Visibility Orders


In this paper we introduce a new class of partially ordered sets, called tree-visibility orders, extending the class of interval orders in a fashion similar to the extension of interval graphs to chordal graphs. This class contains interval orders, duals of generalized interval orders and height one orders. We give a characterization of tree-visibility orders by an infinite family of minimal forbidden suborders and present an efficient recognition algorithm.
Fichier principal
Vignette du fichier
RR-2683.pdf (232.88 Ko) Télécharger le fichier

Dates and versions

inria-00074008 , version 1 (24-05-2006)


  • HAL Id : inria-00074008 , version 1


Dieter Kratsch, Jean-Xavier Rampon. Tree-Visibility Orders. [Research Report] RR-2683, INRIA. 1995. ⟨inria-00074008⟩
67 View
69 Download


Gmail Facebook Twitter LinkedIn More