✦ LIBER ✦

Algorithmic aspects of intersection graphs and representation hypergraphs

✍ Scribed by Martin Charles Golumbic

Publisher: Springer Japan
Year: 1988
Tongue: English
Weight: 893 KB
Volume: 4
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01864170

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Simultaneous intersection representation

Simultaneous intersection representation of pairs of graphs

✍ Tanenbaum, Paul J. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 436 KB 👁 2 views

We characterize the pairs (G 1 , G 2 ) of graphs on a shared vertex set that are intersection polysemic: those for which the vertices may be assigned subsets of a universal set such that G 1 is the intersection graph of the subsets and G 2 is the intersection graph of their complements. We also cons

Intersection Representation of Complete

Intersection Representation of Complete Unbalanced Bipartite Graphs

✍ Nancy Eaton 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 282 KB

A p-intersection representation of a graph G is a map, f, that assigns each vertex a subset of [1, 2, ..., t] The symbol % p (G) denotes this minimum t such that a p-intersection representation of G exists. In 1966 Erdo s, Goodman, and Po sa showed that for all graphs G on 2n vertices, % 1 (G) % 1

On set intersection representations of g

On set intersection representations of graphs

✍ Stasys Jukna 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 193 KB 👁 1 views

## Abstract The intersection dimension of a bipartite graph with respect to a type __L__ is the smallest number __t__ for which it is possible to assign sets __A__~__x__~⊆{1, …, __t__} of labels to vertices __x__ so that any two vertices __x__ and __y__ from different parts are adjacent if and only

On intersection representations of co-pl

On intersection representations of co-planar graphs

✍ Jan Kratochvíl; Aleš Kuběna 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 221 KB

We show that complements of planar graphs have intersection representations by convex sets in the plane, i.e., for every planar graph, one can assign convex sets in the plane to its vertices in such a way that two of the sets are disjoint if and only if the correspondning vertices are adjacent. This

Complexity and Algorithms for Graph and

Complexity and Algorithms for Graph and Hypergraph Sandwich Problems

✍ Yair Caro; Raphael Yuster 📂 Article 📅 1998 🏛 Springer Japan 🌐 English ⚖ 231 KB

Powers of geometric intersection graphs

Powers of geometric intersection graphs and dispersion algorithms

✍ Geir Agnarsson; Peter Damaschke; Magnús M. Halldórsson 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 188 KB

We study powers of certain geometric intersection graphs: interval graphs, m-trapezoid graphs and circular-arc graphs. We deÿne the pseudo-product, (G; G ) → G \* G , of two graphs G and G on the same set of vertices, and show that G \* G is contained in one of the three classes of graphs mentioned