arXiv · alg-geom/9411013
A New Approach to Characterise all the Transitive Orientations for an Undirected Graph
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
A. Belkasri, M. Hamade. 1994-11-18. A New Approach to Characterise all the Transitive Orientations for an Undirected Graph. https://arxiv.org/abs/alg-geom/9411013
Cite the original work for its findings. Save a collection to share your selection of sources.