𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the existence of N-connected graphs with prescribed degrees (n ≧ 2)

✍ Scribed by D. L. Wang; D. J. Kleitman

Publisher
John Wiley and Sons
Year
1973
Tongue
English
Weight
648 KB
Volume
3
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

Chromatic classes of 2-connected (n, n +
Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles
✍ K.M. Koh; K.L. Teo 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 820 KB

Let P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically equivalent, written G-H, if P( G) = P( H). A graph G is chromatically unique if G z H for any graph H such that H-G. Let J? denote the class of 2-connected graphs with n vertices and n+3 edges which contain a

A degree condition for the existence of
A degree condition for the existence of regular factors inK1,n-free graphs
✍ Ota, Katsuhiro; Tokuda, Taro 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 260 KB 👁 2 views

A graph is called K1,.-free if it contains no K l , n as an induced subgraph. Let n ( r 3), r be integers (if r is odd, r 2 n -1). We prove that every Kl,,-free connected graph G with rlV(G)I even has an r-factor if its minimum degree is at least This degree condition is sharp.

On the existence of countable universal
On the existence of countable universal graphs
✍ F�redi, Zolt�n; Komj�th, P�ter 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB 👁 2 views

Let Forb(G) denote the class of graphs with countable vertex sets which do not contain G as a subgraph. If G is finite, 2-connected, but not complete, then Forb(G) has no element which contains every other element of Forb(G) as a subgraph, i.e., this class contains no universal graph.