✦ LIBER ✦

What Are the Intersection Graphs of Arcs in a Circle?

✍ Scribed by Victor Klee

Book ID: 118014783
Publisher: Mathematical Association of America
Year: 1969
Tongue: English
Weight: 544 KB
Volume: 76
Category: Article
ISSN: 0002-9890
DOI: 10.2307/2317880

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The intersection graphs of subtrees in t

The intersection graphs of subtrees in trees are exactly the chordal graphs

✍ Fǎnicǎ Gavril 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 523 KB

The edge intersection graphs of paths in

The edge intersection graphs of paths in a tree

✍ Martin Charles Golumbic; Robert E Jamison 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 791 KB

Graphs in which the neighborhoods of ver

Graphs in which the neighborhoods of vertices are pseudogeometric graphs forGQ(3, 3)

✍ A. K. Gutnova; A. A. Makhnev 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 190 KB

Graphs in which the neighborhoods of ver

Graphs in which the neighborhoods of vertices are pseudogeometric graphs forGQ(3, 5)

✍ A. K. Gutnova; A. A. Makhnev 📂 Article 📅 2011 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 200 KB

A linear-time algorithm for computing th

A linear-time algorithm for computing the intersection of all odd cycles in a graph

✍ Leizhen Cai; Baruch Schieber 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 506 KB

We present a linear-time algorithm that finds all edges and vertices in the intersection of all odd cycles in a given graph. We also show an application of our algorithm to a variant of the satisfiability problem of Boolean formulas.

The number of cut vertices and cut arcs

The number of cut vertices and cut arcs in a strong directed graph

✍ S. B. Rao; A. Ramachandra Rao 📂 Article 📅 1972 🏛 Akadmiai Kiad 🌐 English ⚖ 704 KB