A New Approach to Characterise all the Transitive Orientations for an Undirected Graph

Simple item page
dc.creatorBelkasri, A.
dc.creatorHamade, M.
dc.date1994-11-18
dc.date.accessioned2026-07-07T09:06:18Z
dc.date.available2026-07-07T09:06:18Z
dc.descriptionA new approach to find all the transitive orientations for a comparability graph (finite or infinite) is presented. This approach is based on the link between the notion of ``strong'' partitive set and the forcing theory (notions of simplices and multiplices). A mathematical algorithm is given for the case of a comparability graph which has only non limit sub-graphs.
dc.description20 pages, LaTeX, macro epsf.sty
dc.identifierhttps://arxiv.org/abs/alg-geom/9411013
dc.identifierhttp://arxiv.org/abs/alg-geom/9411013
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/149958
dc.subjectAlgebraic Geometry
dc.titleA New Approach to Characterise all the Transitive Orientations for an Undirected Graph
dc.typetext

Files

Collections

arXiv