✦ LIBER ✦

The number of 4-cycles in triangle-free oriented graphs

✍ Scribed by Shinsei Tazawa; Chiê Nara; John W. Moon

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 290 KB
Volume: 143
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00025-e

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The number of triangles in a K4-free gra

The number of triangles in a K4-free graph

✍ David C. Fisher 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 367 KB

We show that a &-

The chvátal-erdo˝s condition for cycles

The chvátal-erdo˝s condition for cycles in triangle-free graphs

✍ Dingjun Lou 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 235 KB

It is proved that if G is a triangle-free graph with v vertices whose independence number does not exceed its connectivity then G has cycles of every length n for 4: /2 or G is a 5-cyde. This was conjectured by Amar, Fournier and Germa. All graphs considered are finite, undirected and simple. A gra

A note on the independence number of tri

A note on the independence number of triangle-free graphs

✍ James B. Shearer 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 188 KB

A note on the matching numbers of triang

A note on the matching numbers of triangle-free graphs

✍ Roberto W. Frucht; Reinaldo E. Giudici 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB 👁 1 views

Lower bounds on the number of triangles

Lower bounds on the number of triangles in a graph

✍ David C. Fisher 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB 👁 1 views

The number of cycles in 2-factors of cub

The number of cycles in 2-factors of cubic graphs

✍ Moshe Rosenfeld 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 758 KB