The edge clique graph of a graph H is the one having the edge set of H as vertex set, two vertices being adjacent if and only if the corresponding edges belong to a common complete subgraph of H . We characterize the graph classes {edge clique graphs} ∩ {interval graphs} as well as {edge clique grap
✦ LIBER ✦
Clique Graphs and Edge-clique graphs
✍ Scribed by Márcia R. Cerioli
- Book ID
- 108498021
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 84 KB
- Volume
- 13
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Recognizing edge clique graphs among int
✍
Jing Kong; Yaokun Wu
📂
Article
📅
2007
🏛
Elsevier Science
🌐
English
⚖ 250 KB
Sphericity, cubicity, and edge clique co
✍
T.S. Michael; Thomas Quint
📂
Article
📅
2006
🏛
Elsevier Science
🌐
English
⚖ 164 KB
Sphere of influence graphs: Edge density
✍
T.S. Michael; T. Quint
📂
Article
📅
1994
🏛
Elsevier Science
🌐
English
⚖ 444 KB
Cliques and claws in edge-transitive str
✍
Arnold Neumaier
📂
Article
📅
1980
🏛
Springer-Verlag
🌐
French
⚖ 274 KB
A Property About Minimum Edge- and Minim
✍
Raffaele Mosca
📂
Article
📅
2001
🏛
Springer Japan
🌐
English
⚖ 134 KB
Large cliques or stable sets in graphs w
✍
Maria Chudnovsky; Yori Zwols
📂
Article
📅
2011
🏛
John Wiley and Sons
🌐
English
⚖ 312 KB
## Abstract Erdős and Hajnal [Discrete Math 25 (1989), 37–52] conjectured that, for any graph __H__, every graph on __n__ vertices that does not have __H__ as an induced subgraph contains a clique or a stable set of size __n__^ɛ(__H__)^ for some ɛ(__H__)>0. The Conjecture 1. known to be true for gr