𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Arrangements of lines with a minimum number of triangles are simple

✍ Scribed by Jean-Pierre Roudneff

Publisher
Springer
Year
1988
Tongue
English
Weight
253 KB
Volume
3
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Competition numbers of graphs with a sma
Competition numbers of graphs with a small number of triangles
✍ Suh-Ryung Kim; Fred S. Roberts πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 722 KB

If D is an acyclic digraph, its competition graph is an undirected graph with the same vertex set and an edge between vertices x and y if there is a vertex a so that (x, a) and (y, a) are both arcs of D. If G is any graph, G together with sufficiently many isolated vertices is a competition graph, a