𝔖 Bobbio Scriptorium
✦   LIBER   ✦

I-Colorings, I-Phasings, and I-Intersection assignments for graphs, and their applications

✍ Scribed by Robert J. Opsut; Fred S. Roberts

Publisher
John Wiley and Sons
Year
1983
Tongue
English
Weight
718 KB
Volume
13
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Optimal I-Intersection assignments for g
Optimal I-Intersection assignments for graphs: A linear programming approach
✍ Robert J. Opsut; Fred S. Roberts πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 409 KB

An intersection assignment for a graph is the assignment of a set t o each vertex so that edges correspond to pairs of sets which overlap. Intersection assignments are studied in which each set is a real interval, perhaps of specified minimum length. In particular, linear programming methods are use

Grid intersection graphs and boxicity
Grid intersection graphs and boxicity
✍ S. Bellantoni; I. Ben-Arroyo Hartman; T. Przytycka; S. Whitesides πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 558 KB

A graph has hyuiciry k if k is the smallest integer such that G is an intersection graph of k-dimensional boxes in a &-dimensional space (where the sides of the boxes are parallel to the coordinate axis). A graph has grid dimension k if k is the smallest integer such that G is an intersection graph