Transitive orientations of graphs

Authors

Bela Bollobas, University of CambridgeFollow
Graham Brightwell, University of CambridgeFollow

Abstract

Suppose that we have a set X of n objects in some unknown total order <. For G a graph on X, we ask, for each edge xy, 'Is x

Publication Title

SIAM Journal on Computing

Recommended Citation

Bollobas, B., & Brightwell, G. (1988). Transitive orientations of graphs. SIAM Journal on Computing, 17 (6), 1119-1133. https://doi.org/10.1137/0217072