๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On-line algorithms for ordered sets and comparability graphs

โœ Scribed by Stephen G. Penrice

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
668 KB
Volume
60
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Lexicographic orientation and representa
Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs
โœ Pavon Hell; Jing Huang ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 823 KB

## Abstract We introduce a simple new technique which allows us to solve several problems that can be formulated as seeking a suitable orientation of a given undirected graph. In particular, we use this technique to recognize and transitively orient comparability graphs, to recognize and represent

Characterization problems for graphs, pa
Characterization problems for graphs, partially ordered sets, lattices, and families of sets
โœ William T. Trotter Jr.; John I. Moore Jr. ๐Ÿ“‚ Article ๐Ÿ“… 1976 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 909 KB

A standard problem in combinatorial theory is to characterize structures which satisfy a certain property by providing a minimum list of forbidden substructures, for example, Kuratowski's well known characterization of planar graphs. In this paper, we establish connections between characterization p