A New Approach to Characterise all the Transitive Orientations for an Undirected Graph
alg-geom
2008-02-03 v1 Algebraic Geometry
Abstract
A 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.
Cite
@article{arxiv.alg-geom/9411013,
title = {A New Approach to Characterise all the Transitive Orientations for an Undirected Graph},
author = {A. Belkasri and M. Hamade},
journal= {arXiv preprint arXiv:alg-geom/9411013},
year = {2008}
}
Comments
20 pages, LaTeX, macro epsf.sty