𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Small Edge Sets Meeting all Triangles of a Graph

✍ Scribed by S. Aparna Lakshmanan; Cs. Bujtás; Zs. Tuza

Book ID
113036245
Publisher
Springer Japan
Year
2011
Tongue
English
Weight
264 KB
Volume
28
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Strongly edge triangle regular graphs an
Strongly edge triangle regular graphs and a conjecture of Kotzig
✍ B.Radhakrishnan Nair; A. Vijayakumar 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 513 KB

The concepts of strongly vertex triangle regular graphs and strongly edge triangle regular graphs are introduced. An expression for the triangle number of a vertex in the composition of two graphs is obtained. It is proved that a self-complementary graph is strongly regular if and only if it is stro

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