𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graphs and Bergman′s GK Gap Theorem

✍ Scribed by H.W. Ellingsen; D.R. Farkas

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
347 KB
Volume
164
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Turán's theorem and k-connected graphs
Turán's theorem and k-connected graphs
✍ Nicolas Bougard; Gwenaël Joret 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB

## Abstract The minimum size of a __k__‐connected graph with given order and stability number is investigated. If no connectivity is required, the answer is given by Turán's Theorem. For connected graphs, the problem has been solved recently independently by Christophe et al., and by Gitler and Val

Factorizations of 4-Regular Graphs and P
Factorizations of 4-Regular Graphs and Petersen′s Theorem
✍ M. Kouider; G. Sabidussi 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 513 KB

On the basis of the observation that a 3-regular graph has a perfect matching if and only if its line graph has a triangle-free 2 -factorisation, we show that a connected 4-regular graph has a triangle-free 2 -factorisation, provided it has no more than two cut-vertices belonging to a triangle. This