𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Nonhamiltonian 2-connected claw-free graphs with large 4-degree sum

✍ Scribed by Wacław Frydrych

Book ID
108315608
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
93 KB
Volume
236
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Large P4-free graphs with bounded degree
Large P4-free graphs with bounded degree
✍ Myung S. Chung; Douglas B. West 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 424 KB

## Abstract Let __ex__ \* (__D__; __H__) denote the maximum number of edges in a connected graph with maximum degree __D__ and no induced subgraph isomorphic to __H.__ We prove that this is finite only when __H__ is a disjoint union of paths,m in which case we provide crude upper and lower bounds.

Large 2P3-free graphs with bounded degre
Large 2P3-free graphs with bounded degree
✍ Myung S. Chung; Douglas B. West 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 541 KB

Let ex\*(D;H) be the maximum number of edges in a connected graph with maximum degree D and no induced subgraph H; this is finite if and only if H is a disjoint union of paths. If the largest component of such an H has order m, then ex\*(D;H) = O(D2ex\*(D;Pm)). Constructively, ex\*(D;qPm) = O(qD2ex\

The existence of a 2-factor in K1, n-fre
The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity
✍ R. E. L. Aldred; Yoshimi Egawa; Jun Fujisawa; Katsuhiro Ota; Akira Saito 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 1 views

In this article, we study the existence of a 2-factor in a K 1,nfree graph. Sumner [J London Math Soc 13 (1976), 351-359] proved that for n ≥ 4, an (n-1)-connected K 1,n -free graph of even order has a 1-factor.