𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The circle numbers of orbital graphs

✍ Scribed by William L. Quirin


Publisher
Elsevier Science
Year
1971
Tongue
English
Weight
60 KB
Volume
10
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A triangle-free circle graph with chroma
✍ A.A. Ageev πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 170 KB

It follows from the results of , Gyirfis and Lehel (1985), and Kostochka (1988) that 4 ~x\* ## ~5 where x\* = max {X(G): G is a triangle-free circle graph}. We show that X\* ? 5 and thus X\* = 5. This disproves the conjecture of Karapetyan that X\* = 4 and answers negatively a question of Gyirfis

Recognition of Circle Graphs
✍ J. Spinrad πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 736 KB

This paper presents a new algorithm for recognizing circle graphs, combining ideas from an earlier circle graph recognition algorithm due to Gabor, Hsu, and Supowit and an algorithm to determine whether a graph can be decomposed by the split decomposition. The result is an \(O\left(n^{2}\right)\) al

Orientations of circle graphs
✍ R. C. Read; D. Rotem; J. Urrutia πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 756 KB
Numbers of cubic graphs
✍ R. W. Robinson; N. C. Wormald πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 223 KB

## Abstract The numbers of unlabeled cubic graphs on __p = 2n__ points have been found by two different counting methods, the best of which has given values for __p ≦__ 40.

Clique numbers of graphs
✍ Paul ErdΓΆs; Marcel ErnΓ© πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 337 KB

For each natural number n, denote by G(n) the set of all numbers c such that there exists a graph with exactly c cliques (i.e., complete subgraphs) and n vertices. We prove the asymptotic estimate Ia(n)l = 0(2"n -z/5) and show that all natural numbers between n + 1 and 2 "-6"5~6 belong to G(n). Thus