𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The double competition number of some triangle-free graphs

✍ Scribed by Suzanne M. Seager


Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
299 KB
Volume
28
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Competition numbers of graphs with a sma
✍ 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