𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A conjecture on triangles of graphs

✍ Scribed by Zsolt Tuza

Publisher
Springer Japan
Year
1990
Tongue
English
Weight
563 KB
Volume
6
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

A note on the triangle conjecture
A note on the triangle conjecture
✍ Jean-Eric Pin; Imre Simon πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 195 KB
On a harmonious graph conjecture
On a harmonious graph conjecture
✍ Eugene Levine πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 125 KB

Let K~ ) be the umon of two complete graphs on n vertices which have preosely one vertex in common. Graham and Sloane have shown that K~ ~ is not harmomous for n od:~, /(~,~ is harmonious, and K~62~ is not harmonious. They also conjecture that K~' t,, not h,~rmomous except for n = 4. Here, it Is sho

On a conjecture of Tuza about packing an
On a conjecture of Tuza about packing and covering of triangles
✍ Michael Krivelevich πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 312 KB

Zs. Tuza conjectured that if a simple graph G does not contain more than k pairwise edge disjoint triangles, then there exists a set of at most 2k edges which meets all triangles in G. We prove this conjecture for K,, 3 -free graphs (graphs that do not contain a homeomorph of K,. 3). Two fractional