𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Intersection Dimensions of Graph Classes

✍ Scribed by Jan Kratochvil; Zsolt Tuza

Book ID
105677098
Publisher
Springer Japan
Year
1994
Tongue
English
Weight
530 KB
Volume
10
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Characterizing intersection classes of g
Characterizing intersection classes of graphs
✍ Edward R. Scheinerman πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 571 KB

A graph is an intersection graph if it is possible to assign sets to its vertices so that adjacency corresponds exactly to nonempty intersection. If the sets assigned to vertices must belong to a pre-specified family, the resulting class of all possible intersection graphs is called an intersection

Measuring the vulnerability for classes
Measuring the vulnerability for classes of intersection graphs
✍ Dieter Kratsch; Ton Kloks; Haiko Muller πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 780 KB

A general method for the computation of various parameters measuring the vulnerability of a graph is introduced. Four measures of vulnerability are considered, i.e., the toughness, scattering number, vertex integrity and the size of a minimum balanced separator. We show how to compute these paramete

Intersections of 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,

INTERSECTION GRAPH OF A MODULE
INTERSECTION GRAPH OF A MODULE
✍ YARANERI, ERGÜN πŸ“‚ Article πŸ“… 2013 πŸ› World Scientific Publishing Company 🌐 English βš– 402 KB