𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On intersections of interval graphs

✍ Scribed by H.S. Witsenhausen


Book ID
107748326
Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
687 KB
Volume
31
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On minimum intersection of two minimum d
✍ Chang Maw-Shang; Hsu Chung-Chang πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 748 KB

This paper gives linear-time algorithms for finding two minimum (connected) dominating sets with minimum intersection for interval graphs.

Intersections of graphs
✍ BΓ©la BollobΓ‘s; Alex Scott πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 193 KB

Let G and H be two graphs of order n. If we place copies of G and H on a common vertex set, how much or little can they be made to overlap? The aim of this article is to provide some answers to this question, and to pose a number of related problems. Along the way, we solve a conjecture of Erd" os,

On grid intersection graphs
✍ I.Ben-Arroyo Hartman; Ilan Newman; Ran Ziv πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 759 KB

Hartman I.B.-A., I. Newman and R. Ziv, On grid intersection graphs, Discrete Mathematics 87 (1991) 41-52. A bipartite graph G = (X, Y; E) has a grid representation if X and Y correspond to sets of horizontal and vertical segments in the plane, respectively, such that (xi, y,) E E if and only if segm

On probe interval graphs
✍ F.R. McMorris; Chi Wang; Peisen Zhang πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 723 KB

Probe interval graphs have been introduced in the physical mapping and sequencing of DNA as a generalization of interval graphs. We prove that probe interval graphs are weakly triangulated, and hence are perfect, and characterize probe interval graphs by consecutive orders of their intrinsic cliques