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,
✦ LIBER ✦
INTERSECTION GRAPH OF A MODULE
✍ Scribed by YARANERI, ERGÜN
- Book ID
- 120656138
- Publisher
- World Scientific Publishing Company
- Year
- 2013
- Tongue
- English
- Weight
- 402 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0219-4988
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Intersections of graphs
✍
Béla Bollobás; Alex Scott
📂
Article
📅
2011
🏛
John Wiley and Sons
🌐
English
⚖ 193 KB
The Steinberg module of a graph
✍
Dina Ghinelli; Dieter Jungnickel
📂
Article
📅
1990
🏛
Springer
🌐
English
⚖ 170 KB
On the intersection rank of a graph
✍
James A. Wiseman
📂
Article
📅
1992
🏛
Elsevier Science
🌐
English
⚖ 748 KB
Wiseman, J.A., On the intersection rank of a graph, Discrete Mathematics 104 293-305.
Intersection of Longest Paths in a Graph
✍
Susanna F. de Rezende; Cristina G. Fernandes; Daniel M. Martin; Yoshiko Wakabaya
📂
Article
📅
2011
🏛
Elsevier Science
🌐
English
⚖ 187 KB
Intersection Dimensions of Graph Classes
✍
Jan Kratochvil; Zsolt Tuza
📂
Article
📅
1994
🏛
Springer Japan
🌐
English
⚖ 530 KB
Intersection properties of graphs
✍
Terry A. McKee
📂
Article
📅
1991
🏛
Elsevier Science
🌐
English
⚖ 550 KB
McKee, T.A., Intersection properties of graphs, Discrete Mathematics 89 (1991) 253-260. For each graph-theoretic property, we define a corresponding 'intersection property', motivated by the natural relationship of paths with interval graphs, and of trees with chordal graphs. We then develop a simp