𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Proper and unit tolerance graphs

✍ Scribed by Kenneth P. Bogart; Peter C. Fishburn; Garth Isaak; Larry Langley

Book ID
104184570
Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
985 KB
Volume
60
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Proper and Unit Trapezoid Orders and Gra
Proper and Unit Trapezoid Orders and Graphs
✍ Kenneth P. Bogart; Rolf H. MΓΆhring; Stephen P. Ryan πŸ“‚ Article πŸ“… 1998 πŸ› Springer Netherlands 🌐 English βš– 847 KB
Proper and unit bitolerance orders and g
Proper and unit bitolerance orders and graphs
✍ Kenneth P. Bogart; Garth Isaak πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 729 KB

We say any order ~ is a tolerance order on a set of vertices if we may assign to each vertex x an interval Ix of real numbers and a real number tx called a tolerance in such a way that x~,y if and only if the overlap of Ix and ly is less than the minimum of t~ and ty and the center of I~ is less tha

A relationship between triangulated grap
A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
✍ Dale J. Skrien πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 319 KB πŸ‘ 1 views

## Abstract Given a set __F__ of digraphs, we say a graph __G__ is a __F__‐__graph__ (resp., __F__\*‐__graph__) if it has an orientation (resp., acyclic orientation) that has no induced subdigraphs isomorphic to any of the digraphs in __F__. It is proved that all the classes of graphs mentioned in

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