✦ LIBER ✦

Intersection number of two connected geometric graphs

✍ Scribed by Shin-ichi Tokunaga

Book ID: 107766324
Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 285 KB
Volume: 59
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(96)00124-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Intersection number and capacities of gr

Intersection number and capacities of graphs

✍ J. Körner 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 955 KB

For an arbitrary graph G we determine the asymptotics of the intersection number (edgeclique covering number) of the categorical (or weak) product of G and the complete graph K,, asymptotically in n. The result follows from a more general theorem on graph capacities which generalizes an earlier resu

On the stability number of the edge inte

On the stability number of the edge intersection of two graphs

✍ Claudio Arbib; Alberto Caprara 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 38 KB

Let G be the graph obtained as the edge intersection of two graphs G 1 , G 2 on the same vertex set V . We show that if at , where α() is the cardinality of the largest stable set. Moreover, for general G 1 and G 2 , we show that α(G) R(α(G 1 ) + 1, α(G 2 ) + 1) -1, where R(k, ) is the Ramsey numbe

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

Coloring the complements of intersection

Coloring the complements of intersection graphs of geometric figures

✍ Seog-Jin Kim; Kittikorn Nakprasit 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 154 KB

The number of strongly connected directe

The number of strongly connected directed graphs

✍ V. A. Liskovets 📂 Article 📅 1970 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 460 KB

The number of connected sparsely edged g

The number of connected sparsely edged graphs

✍ E. M. Wright 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 472 KB

## Abstract An (__n, q__) graph has __n__ labeled points, __q__ edges, and no loops or multiple edges. The number of connected (__n, q__) graphs is __f(n, q)__. Cayley proved that __f(n, n__^‐1^) = __n__^n−2^ and Renyi found a formula for __f(n, n)__. Here I develop two methods to calculate the exp