✦ LIBER ✦

On the 1-factors of n-connected graphs

✍ Scribed by Joseph Zaks

Publisher: Elsevier Science
Year: 1971
Tongue: English
Weight: 664 KB
Volume: 11
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(71)90027-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Connected [k, k + 1]-factors of graphs

✍ Mao-cheng Cai 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 541 KB

Let k be an odd integer /> 3, and G be a connected graph of odd order n with n/>4k -3, and minimum degree at least k. In this paper it is proved that if for each pair of nonadjacent vertices u, v in G max{dG(u), d~(v)} >~n/2, then G has an almost k--factor F + and a matching M such that F-and M are

On n-connected graphs

✍ Branko Grünbaum 📂 Article 📅 1969 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB

The main aim of the present note is the proof of a variant of the MENGER-WHITNEY theorem on n-connected graphs (Theorem 1 below). While the result itself is well known (being, for example, a special case of the theorem of MENGER mentioned in Remark I), two of its aspects deserve attention. First, it

The number of 1-factors in 2k-connected

The number of 1-factors in 2k-connected graphs

✍ Béla Bollobas 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 166 KB

On factors of 4-connected claw-free grap

On factors of 4-connected claw-free graphs

✍ H. J. Broersma; M. Kriesell; Z. Ryjác̆ek 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB

## Abstract We consider the existence of several different kinds of factors in 4‐connected claw‐free graphs. This is motivated by the following two conjectures which are in fact equivalent by a recent result of the third author. Conjecture 1 (Thomassen): Every 4‐connected line graph is hamiltonian,

On Minimally (n, λ)-Connected Graphs

✍ Atsushi Kaneko; Katsuhiro Ota 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 128 KB

A graph G is (n, \*)-connected if it satisfies the following conditions: (1) |V(G)| n+1; (2) for any subset S V(G) and any subset L E(G) with \* |S| +|L| <n\*, G&S&L is connected. The (n, \*)-connectivity is a common extension of both the vertex-connectivity and the edge-connectivity. An (n, 1)-conn

On k-critical, n-connected graphs

✍ Stephen Maurer; Peter J. Slater 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 718 KB

A graph G which iit n-connected (but not (I! I)-connected) is defined ro be k-xitical if for every S 6; V(G), where f S i d k. the connectivity of G -I S is h -/S ia We will say that G is an (n\*,k\*) graph if G is n-conneckxt (b:lt nat (n t Itconnected) and k-crirical (hut not (k c l)criticaf). Thi