A New Approach to Characterise all the Transitive Orientations for an Undirected Graph
A. Belkasri, M. Hamade
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.
Create a lesson
Related papers
Complements on surfaces
V. V. Shokurov
Isolated rational curves on K3-fibered Calabi-Yau threefolds
Torsten Ekedahl, Trygve Johnsen, Dag Einar Sommervoll
Cohomology of complete intersections in toric varieties
Anvar R. Mavlyutov
The Gross-Kohnen-Zagier theorem in higher dimensions
Richard E. Borcherds
Real deformations and complex topology of plane curve singularities
Norbert A'Campo
Irreducibility of the moduli space of vector bundles on surfaces and Brill-Noether theory on singular curves
Tomas L. Gomez